1390 search results - page 184 / 278 » Computing the depth of a flat |
123
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This paper presents a methodology to develop recursive filters in reproducing kernel Hilbert spaces (RKHS). Unlike previous approaches that exploit the kernel trick on filtered ...
126
click to vote
TEI
2012
ACM
13 years 5 months ago
2012
ACM
Most current mobile technologies require on-screen operations for interacting with devices’ visual contents. However, as a trade-off for mobility, screens usually provide limite...
DAC
1999
ACM
15 years 11 months ago
1999
ACM
We empirically assess the implications of fixed terminals for hypergraph partitioning heuristics. Our experimental testbed incorporates a leading-edge multilevel hypergraph partit...
KDD
2003
ACM
15 years 10 months ago
2003
ACM
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...