Sciweavers

77 search results - page 12 / 16
» Optimal leaf ordering of complete binary trees
Sort
View
143
Voted
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
15 years 6 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
184
Voted
INFOCOM
2008
IEEE
16 years 23 days ago
Distributed Operator Placement and Data Caching in Large-Scale Sensor Networks
Abstract—Recent advances in computer technology and wireless communications have enabled the emergence of stream-based sensor networks. In such sensor networks, real-time data ar...
Lei Ying, Zhen Liu, Donald F. Towsley, Cathy H. Xi...
ICCAD
1997
IEEE
90views Hardware» more  ICCAD 1997»
15 years 10 months ago
A hierarchical decomposition methodology for multistage clock circuits
† This paper describes a novel methodology to automate the design of the interconnect distribution for multistage clock circuits. We introduce two key ideas. First, a hierarchica...
Gary Ellis, Lawrence T. Pileggi, Rob A. Rutenbar
178
Voted
SPAA
1990
ACM
15 years 10 months ago
Optimal Cooperative Search in Fractional Cascaded Data Structures
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...
Roberto Tamassia, Jeffrey Scott Vitter
178
Voted
ICCV
2011
IEEE
14 years 6 months ago
Discriminative Learning of Relaxed Hierarchy for Large-scale Visual Recognition
In the real visual world, the number of categories a classifier needs to discriminate is on the order of hundreds or thousands. For example, the SUN dataset [24] contains 899 sce...
Tianshi Gao, Daphne Koller