Sciweavers

2434 search results - page 342 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
121
Voted
FOCS
2006
IEEE
15 years 9 months ago
Hardness of Learning Halfspaces with Noise
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
Venkatesan Guruswami, Prasad Raghavendra
ADHOC
2010
195views more  ADHOC 2010»
15 years 3 months ago
SDRT: A reliable data transport protocol for underwater sensor networks
In this paper, we investigate the reliable data transport problem in underwater sensor networks. Underwater sensor networks are significantly different from terrestrial sensor net...
Peng Xie, Zhong Zhou, Zheng Peng, Jun-Hong Cui, Zh...
CORR
2007
Springer
113views Education» more  CORR 2007»
15 years 3 months ago
Communication under Strong Asynchronism
We consider asynchronous communication over point-to-point discrete memoryless channels without feedback. The transmitter starts sending one block codeword at an instant that is u...
Aslan Tchamkerten, Venkat Chandar, Gregory W. Worn...
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 3 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
128
Voted
PVLDB
2008
100views more  PVLDB 2008»
15 years 3 months ago
Efficiently approximating query optimizer plan diagrams
Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the o...
Atreyee Dey, Sourjya Bhaumik, Harish D., Jayant R....