Sciweavers

329 search results - page 25 / 66
» New lower bounds for some spherical designs
Sort
View
INFOCOM
2009
IEEE
14 years 3 months ago
Optimal Fast Hashing
Abstract—This paper is about designing optimal highthroughput hashing schemes that minimize the total number of memory accesses needed to build and access an hash table. Recent s...
Josef Kanizo, David Hay, Isaac Keslassy
DAC
1997
ACM
14 years 20 days ago
More Practical Bounded-Skew Clock Routing
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
Andrew B. Kahng, Chung-Wen Albert Tsao
IANDC
2006
102views more  IANDC 2006»
13 years 8 months ago
Polynomial certificates for propositional classes
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
Marta Arias, Aaron Feigelson, Roni Khardon, Rocco ...
ALT
2011
Springer
12 years 8 months ago
Semantic Communication for Simple Goals Is Equivalent to On-line Learning
Abstract. Previous works [11, 6] introduced a model of semantic communication between a “user” and a “server,” in which the user attempts to achieve a given goal for commun...
Brendan Juba, Santosh Vempala
TWC
2010
13 years 3 months ago
Robustness analysis and new hybrid algorithm of wideband source localization for acoustic sensor networks
Wideband source localization using acoustic sensor networks has been drawing a lot of research interest recently in wireless communication applications, such as cellular handset lo...
Kun Yan, Hsiao-Chun Wu, S. Sitharama Iyengar