2479 search results - page 193 / 496 » Quantum complexity theory |
184
click to vote
ACL
1994
15 years 8 months ago
1994
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
193
Voted
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
Object detection in aerial imagery has been well studied in computer vision for years. However, given the complexity of large variations of the appearance of the object and the ba...
172
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
We define and study the bandwidth determination problem in adhoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload ...
226
Voted
PODS
2006
ACM
16 years 6 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
166
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...