Search results for "tree-depth"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
38	Sara Silva, Jonas S. Almeida	Dynamic Maximum Tree Depth.	GECCO	2003	DBLP DOI BibTeX RDF
35	Zhenqiang Li, Dongqu Zheng, Yan Ma	Using Bit Selection to Do Routing Table Lookup.	FAW	2007	DBLP DOI BibTeX RDF	Routing Table Lookup, Bit Selection, Algorithm, IPv6, IPv4
34	Sara Silva, Ernesto Costa	Comparing tree depth limits and resource-limited GP.	Congress on Evolutionary Computation	2005	DBLP DOI BibTeX RDF
30	Mikhail Moshkov	Approximate Algorithm for Minimization of Decision Tree Depth.	RSFDGrC	2003	DBLP DOI BibTeX RDF	decision tree, decision table, depth, data table
30	Yongqiang Zhang 0001, Huashan Chen	Improved Approach of Genetic Programming and Applications for Data Mining.	ICNC (1)	2006	DBLP DOI BibTeX RDF	dynamic tree depth, data mining, ordinary differential equation, GP
25	William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman	Augmented Ring Networks.	IEEE Trans. Parallel Distributed Syst.	2001	DBLP DOI BibTeX RDF	express rings, hierarchical ring networks, diameter trade-offs, graph embedding, Ring networks, multirings, chordal rings, grid graphs
24	Guang Tan, Stephen A. Jarvis	Improving the Fault Resilience of Overlay Multicast for Media Streaming.	IEEE Trans. Parallel Distributed Syst.	2007	DBLP DOI BibTeX RDF	Reliability, peer-to-peer, multicast, overlay, media streaming, fault resilience
22	Sara Silva, Ernesto Costa	Dynamic Limits for Bloat Control: Variations on Size and Depth.	GECCO (2)	2004	DBLP DOI BibTeX RDF
20	Hao-Chieh Chang, Zhong-Lan Yang, Chung-Jr Lian, Liang-Gee Chen	Hardware-efficient architecture design of tree-depth scanning and multiple quantization scheme for MPEG-4 still texture coding.	ISCAS (2)	2001	DBLP DOI BibTeX RDF
18	Mikhail Ju. Moshkov	Greedy Algorithm of Decision Tree Construction for Real Data Tables.	Trans. Rough Sets	2004	DBLP DOI BibTeX RDF	decision tree, decision table, depth, data table
18	Mikhail Ju. Moshkov	Greedy Algorithm for Decision Tree Construction in Context of Knowledge Discovery Problems.	Rough Sets and Current Trends in Computing	2004	DBLP DOI BibTeX RDF	approximate decision tree, knowledge discovery, greedy algorithm, data table
18	Matt DeVos, O-joung Kwon, Sang-il Oum	Branch-depth: Generalizing tree-depth of graphs.	Eur. J. Comb.	2020	DBLP DOI BibTeX RDF
18	Guang Tan, Stephen A. Jarvis, Daniel P. Spooner	Improving the Fault Resilience of Overlay Multicast for Media Streaming.	DSN	2006	DBLP DOI BibTeX RDF
18	Phuong Hoai Ha, Marina Papatriantafilou, Philippas Tsigas	Self-tuning Reactive Distributed Trees for Counting and Balancing.	OPODIS	2004	DBLP DOI BibTeX RDF
17	Benjamin Rossman	Homomorphism preservation theorems.	J. ACM	2008	DBLP DOI BibTeX RDF	preservation theorems, quantifier-rank, tree-depth, first-order logic, conjunctive queries, homomorphisms, Finite model theory
17	Rüdiger Reischuk, Bernd Schmeltz	Reliable Computation with Noisy Circuits and Decision Trees-A General n log n Lower Bound	FOCS	1991	DBLP DOI BibTeX RDF	noisy decision tree complexity, tree depth, noisy circuits, critical number, static Boolean decision trees, erroneous answers, noisy dynamic decision trees, lower bound, Boolean functions, computational model, Boolean circuits, questions, answers
15	Dan Williams, Emin Gün Sirer	Optimal Parameter Selection for Efficient Memory Integrity Verification Using Merkle Hash Trees.	NCA	2004	DBLP DOI BibTeX RDF
13	David M. Chen, Sam S. Tsai, Vijay Chandrasekhar 0001, Gabriel Takacs, Jatinder Pal Singh, Bernd Girod	Tree Histogram Coding for Mobile Image Matching.	DCC	2009	DBLP DOI BibTeX RDF
13	Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc	Tree Exploration with an Oracle.	MFCS	2006	DBLP DOI BibTeX RDF
13	Jin-Han Jeon, Keyong-Hoon Kim, Jiseung Nam	The Algorithm for Constructing an Efficient Data Delivery Tree in Host-Based Multicast Scheme.	ICOIN	2005	DBLP DOI BibTeX RDF
12	Anton Chechetka, Katia P. Sycara	A decentralized variable ordering method for distributed constraint optimization.	AAMAS	2005	DBLP DOI BibTeX RDF	constraint satisfaction
12	John T. Hancock, Taghi M. Khoshgoftaar	Exploring Maximum Tree Depth and Random Undersampling in Ensemble Trees to Optimize the Classification of Imbalanced Big Data.	SN Comput. Sci.	2023	DBLP DOI BibTeX RDF
12	Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula	The complexity of bicriteria tree-depth.	Theor. Comput. Sci.	2023	DBLP DOI BibTeX RDF
12	Deepanshu Kush, Benjamin Rossman	Tree-Depth and the Formula Complexity of Subgraph Isomorphism.	SIAM J. Comput.	2023	DBLP DOI BibTeX RDF
12	Konrad Staniszewski	Parity Games of Bounded Tree-Depth.	CSL	2023	DBLP DOI BibTeX RDF
12	Konrad Staniszewski	Parity Games of Bounded Tree-Depth.	CoRR	2022	DBLP DOI BibTeX RDF
12	Stefan Kratsch, Florian Nelles	Efficient parameterized algorithms on graphs with heterogeneous structure: Combining tree-depth and modular-width.	CoRR	2022	DBLP DOI BibTeX RDF
12	Timothy F. N. Chan, Jacob W. Cooper, Martin Koutecký, Daniel Král, Kristýna Pekárková	Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming.	SIAM J. Comput.	2022	DBLP DOI BibTeX RDF
12	Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula	The Complexity of Bicriteria Tree-Depth.	CoRR	2021	DBLP BibTeX RDF
12	David Cortes	Isolation forests: looking beyond tree depth.	CoRR	2021	DBLP BibTeX RDF
12	Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula	The Complexity of Bicriteria Tree-Depth.	FCT	2021	DBLP DOI BibTeX RDF
12	Deepanshu Kush, Benjamin Rossman	Tree-depth and the Formula Complexity of Subgraph Isomorphism.	Electron. Colloquium Comput. Complex.	2020	DBLP BibTeX RDF
12	Tobias Markus Krabel, Thi Ngoc Tien Tran, Andreas Groll, Daniel Horn, Carsten Jentsch	Random boosting and random^2 forests - A random tree depth injection approach.	CoRR	2020	DBLP BibTeX RDF
12	Martin Grohe	Counting Bounded Tree Depth Homomorphisms.	CoRR	2020	DBLP BibTeX RDF
12	Deepanshu Kush, Benjamin Rossman	Tree-depth and the Formula Complexity of Subgraph Isomorphism.	CoRR	2020	DBLP BibTeX RDF
12	Martin Grohe	Counting Bounded Tree Depth Homomorphisms.	LICS	2020	DBLP DOI BibTeX RDF
12	Deepanshu Kush, Benjamin Rossman	Tree-depth and the Formula Complexity of Subgraph Isomorphism.	FOCS	2020	DBLP DOI BibTeX RDF
12	Timothy F. N. Chan, Jacob W. Cooper, Martin Koutecký, Daniel Král', Kristýna Pekárková	Matrices of Optimal Tree-Depth and Row-Invariant Parameterized Algorithm for Integer Programming.	ICALP	2020	DBLP DOI BibTeX RDF
12	Ben Strasser	PACE Solver Description: Tree Depth with FlowCutter.	IPEC	2020	DBLP DOI BibTeX RDF
12	Alex Borges, Bruno Zatt, Marcelo Schiavon Porto, Luciano Agostini, Guilherme Corrêa 0001	Complexity Scalable HEVC-to-AV1 Transcoding Based on Coding Tree Depth Inheritance.	EUSIPCO	2019	DBLP DOI BibTeX RDF
12	Kun Duan, Pengyu Liu 0001, Kebin Jia, Zeqi Feng	An Adaptive Quad-Tree Depth Range Prediction Mechanism for HEVC.	IEEE Access	2018	DBLP DOI BibTeX RDF
12	Marcin Wrochna	Reconfiguration in bounded bandwidth and tree-depth.	J. Comput. Syst. Sci.	2018	DBLP DOI BibTeX RDF
12	Michael D. Barrus, John Sinkovic	On 1-uniqueness and dense critical graphs for tree-depth.	Discret. Math.	2018	DBLP DOI BibTeX RDF
12	Yijia Chen, Jörg Flum	Tree-depth, quantifier elimination, and quantifier rank.	LICS	2018	DBLP DOI BibTeX RDF
12	Yoichi Iwata, Tomoaki Ogasawara, Naoto Ohsaka	On the Power of Tree-Depth for Fully Polynomial FPT Algorithms.	STACS	2018	DBLP DOI BibTeX RDF
12	Martin Fürer, Huiwen Yu	Space Saving by Dynamic Algebraization Based on Tree-Depth.	Theory Comput. Syst.	2017	DBLP DOI BibTeX RDF
12	Yoichi Iwata, Tomoaki Ogasawara, Naoto Ohsaka	On the Power of Tree-Depth for Fully Polynomial FPT Algorithms.	CoRR	2017	DBLP BibTeX RDF
12	Jaroslav Nesetril, Patrice Ossona de Mendez	A distributed low tree-depth decomposition algorithm for bounded expansion classes.	Distributed Comput.	2016	DBLP DOI BibTeX RDF
12	Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak	Tree-depth and vertex-minors.	Eur. J. Comb.	2016	DBLP DOI BibTeX RDF
12	Michael D. Barrus, John Sinkovic	Uniqueness and minimal obstructions for tree-depth.	Discret. Math.	2016	DBLP DOI BibTeX RDF
12	Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk	Computing Tree-Depth Faster Than 2n.	Algorithmica	2015	DBLP DOI BibTeX RDF
12	Jaroslav Nesetril, Patrice Ossona de Mendez	On Low Tree-Depth Decompositions.	Graphs Comb.	2015	DBLP DOI BibTeX RDF
12	Jun Ogata, Koichi Ichige	Non-iterative coding tree depth estimation for H.265/HEVC using neighboring block information.	ICICS	2015	DBLP DOI BibTeX RDF
12	Tim Biedert, Christoph Garth	Contour Tree Depth Images For Large Data Visualization.	EGPGV@EuroVis	2015	DBLP DOI BibTeX RDF
12	Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak	Tree-depth and Vertex-minors.	CoRR	2014	DBLP BibTeX RDF
12	Guillem Perarnau, Oriol Serra	On the tree-depth of random graphs.	Discret. Appl. Math.	2014	DBLP DOI BibTeX RDF
12	Pratyush Kumar Ranjan, Dileep Pacharla, Biju Ravindran, Devendran Mani	Quality evaluation of HEVC main still picture with limited coding tree depth and intra modes.	ICACCI	2014	DBLP DOI BibTeX RDF
12	Zdenek Dvorák 0001, Martin Kupec, Vojtech Tuma	A Dynamic Data Structure for MSO Properties in Graphs with Bounded Tree-Depth.	ESA	2014	DBLP DOI BibTeX RDF
12	Pablo García-Sánchez, Antonio Fernández-Ares, Antonio Miguel Mora, Pedro Ángel Castillo Valdivieso, Jesús González 0001, Juan Julián Merelo Guervós	Tree Depth Influence in Genetic Programming for Generation of Competitive Agents for RTS Games.	EvoApplications	2014	DBLP DOI BibTeX RDF
12	Mohammad Azad, Mikhail Ju. Moshkov	Minimization of decision tree depth for multi-label decision tables.	GrC	2014	DBLP DOI BibTeX RDF
12	Zdenek Dvorák 0001, Martin Kupec, Vojtech Tuma	Dynamic Data Structure for Tree-Depth Decomposition.	CoRR	2013	DBLP BibTeX RDF
12	Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk	Computing Tree-depth Faster Than 2n.	CoRR	2013	DBLP BibTeX RDF
12	Thaísa Leal da Silva, Luís Alberto da Silva Cruz, Luciano Volcan Agostini	Inter-view prediction of coding tree depth for HEVC-based multiview video coding.	ICECS	2013	DBLP DOI BibTeX RDF
12	Guilherme Corrêa 0001, Pedro Assuncao, Luciano Volcan Agostini, Luís Alberto da Silva Cruz	Coding Tree Depth Estimation for Complexity Reduction of HEVC.	DCC	2013	DBLP DOI BibTeX RDF
12	Thaísa Leal da Silva, Luís Alberto da Silva Cruz, Luciano Volcan Agostini	HEVC intra mode decision acceleration based on tree depth levels relationship.	PCS	2013	DBLP DOI BibTeX RDF
12	Thaísa Leal da Silva, Luciano Volcan Agostini, Luís Alberto da Silva Cruz	Speeding up HEVC intra coding based on tree depth inter-levels correlation structure.	EUSIPCO	2013	DBLP BibTeX RDF
12	Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk	Computing Tree-Depth Faster Than 2 n.	IPEC	2013	DBLP DOI BibTeX RDF
12	Mourad Amad, Ahmed Meddahi, Djamil Aïssani, Gilles Vanwormhoudt	GPM: A generic and scalable P2P model that optimizes tree depth for multicast communications.	Int. J. Commun. Syst.	2012	DBLP DOI BibTeX RDF
12	Zdenek Dvorák 0001, Archontia C. Giannopoulou, Dimitrios M. Thilikos	Forbidden graphs for tree-depth.	Eur. J. Comb.	2012	DBLP DOI BibTeX RDF
12	Archontia C. Giannopoulou, Paul Hunter, Dimitrios M. Thilikos	LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth.	Discret. Appl. Math.	2012	DBLP DOI BibTeX RDF
12	Guilherme Corrêa 0001, Pedro Assuncao, Luciano Volcan Agostini, Luís Alberto da Silva Cruz	Motion compensated tree depth limitation for complexity control of HEVC encoding.	ICIP	2012	DBLP DOI BibTeX RDF
12	Guilherme Corrêa 0001, Pedro Assuncao, Luís Alberto da Silva Cruz, Luciano Volcan Agostini	Dynamic tree-depth adjustment for low power HEVC encoders.	ICECS	2012	DBLP DOI BibTeX RDF
12	Guillem Perarnau, Oriol Serra	On the tree-depth of Random Graphs	CoRR	2011	DBLP BibTeX RDF
12	Archontia C. Giannopoulou, Dimitrios M. Thilikos	Obstructions for Tree-depth.	Electron. Notes Discret. Math.	2009	DBLP DOI BibTeX RDF
12	Jaroslav Nesetril, Patrice Ossona de Mendez	Tree-depth, subgraph coloring and homomorphism bounds.	Eur. J. Comb.	2006	DBLP DOI BibTeX RDF
12	Mikhail Moshkov	Some Bounds on Minimal Decision Tree Depth.	Fundam. Informaticae	1996	DBLP DOI BibTeX RDF
11	Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov	Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs.	GD	1998	DBLP DOI BibTeX RDF
10	Shao Liu, Rui Zhang-Shen, Wenjie Jiang 0001, Jennifer Rexford, Mung Chiang	Performance bounds for peer-assisted live streaming.	SIGMETRICS	2008	DBLP DOI BibTeX RDF	peer-to-peer, video, streaming, IPTV, tree construction
8	Tsvi Kopelowitz, Moshe Lewenstein	Dynamic weighted ancestors.	SODA	2007	DBLP BibTeX RDF
8	Angela Bonifati, Alfredo Cuzzocrea	Efficient Fragmentation of Large XML Documents.	DEXA	2007	DBLP DOI BibTeX RDF
8	Adam R. Livingston, Vijayan K. Asari	Regional Variance Dependant Sub-frame Reduction for Face Detection in High Definition Video Frames.	AIPR	2007	DBLP DOI BibTeX RDF	Regional Variance, High Definition Video, Face detection, Quad-tree
8	Jaroslav Nesetril, Patrice Ossona de Mendez	Linear time low tree-width partitions and algorithmic consequences.	STOC	2006	DBLP DOI BibTeX RDF	bounded expansion, fraternal augmentation, coloration, first order logic, subgraph isomorphism, tree-width, graph minor
8	Eric Allender, Anna Bernasconi 0001, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor E. Shparlinski	Complexity of some arithmetic problems for binary polynomials.	Comput. Complex.	2003	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000). ((no classification))
8	Ingemar J. Cox, Sunita L. Hingorani	An Efficient Implementation of Reid's Multiple Hypothesis Tracking Algorithm and Its Evaluation for the Purpose of Visual Tracking.	IEEE Trans. Pattern Anal. Mach. Intell.	1996	DBLP DOI BibTeX RDF	Multiple hypothesis tracking, motion correspondence, ranked bipartite graph matching, tracking, visual tracking, data association
8	Bruno Ciciani	Redundancy effect on yield of binary tree RAMs.	J. Electron. Test.	1991	DBLP DOI BibTeX RDF	semiconductor memory design, VLSI chip design, yield evaluation, Fault-tolerant memories
6	Guido Sautter, Cristina Abba, Klemens Böhm	Improved count suffix trees for natural language data.	IDEAS	2008	DBLP DOI BibTeX RDF	count suffix tree, query optimization, pruning, selectivity estimation, text data
6	Mike Liddell, Alistair Moffat	Incremental Calculation of Minimum-Redundancy Length-Restricted Codes.	IEEE Trans. Commun.	2007	DBLP DOI BibTeX RDF
6	Eunyong Park, Sunyoung Han, Sangjoon Ahn, Hyunje Park, Sangchul Shin	Scalable and Reliable Overlay Multicast Network for Live Media Streaming.	PCM (2)	2005	DBLP DOI BibTeX RDF
6	William Elazmeh	Search Bound Strategies for Rule Mining by Iterative Deepening.	AI	2003	DBLP DOI BibTeX RDF
6	William B. Langdon, Riccardo Poli	Boolean Functions Fitness Spaces.	EuroGP	1999	DBLP DOI BibTeX RDF
6	Anna Bernasconi 0001, Carsten Damm, Igor E. Shparlinski	On the Average Sensitivity of Testing Square-Free Numbers.	COCOON	1999	DBLP DOI BibTeX RDF
6	Andrew Sohn, Mitsuhisa Sato, Shuichi Sakai, Yuetsu Kodama, Yoshinori Yamaguchi	Nonnumeric search results on the EM-4 distributed-memory multiprocessor.	SC	1994	DBLP DOI BibTeX RDF