Sciweavers

2432 search results - page 188 / 487
» Degrees and choice numbers
Sort
View
FOCS
2007
IEEE
15 years 10 months ago
Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
Arkadev Chattopadhyay
BMCBI
2006
106views more  BMCBI 2006»
15 years 6 months ago
Gene and protein nomenclature in public databases
Background: Frequently, several alternative names are in use for biological objects such as genes and proteins. Applications like manual literature search, automated text-mining, ...
Katrin Fundel, Ralf Zimmer
JFR
2007
176views more  JFR 2007»
15 years 6 months ago
Two years of Visual Odometry on the Mars Exploration Rovers
NASA’s two Mars Exploration Rovers (MER) have successfully demonstrated a robotic Visual Odometry capability on another world for the first time. This provides each rover with ...
Mark W. Maimone, Yang Cheng, Larry Matthies
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 6 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy
ICDT
2009
ACM
147views Database» more  ICDT 2009»
16 years 7 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff