785 search results - page 79 / 157 » Binary Join Trees |
ICIP
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper describes novel methods for estimating piecewise homogeneous Poisson elds based on minimum description length (MDL) criteria. By adopting a coding-theoretic approach, o...
PDCAT
2004
Springer
15 years 3 months ago
2004
Springer
Recent works have classified de Bruijn graph (dBG) based broadcasting algorithms into local broadcasting and arc-disjoint spanning trees based broadcasting. However, those algorit...
ENDM
2010
14 years 10 months ago
2010
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
ALGORITHMICA
2005
14 years 9 months ago
2005
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
180
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Sp...