Sciweavers

328 search results - page 25 / 66
» Deterministic k-set structure
Sort
View
MM
2004
ACM
106views Multimedia» more  MM 2004»
14 years 23 days ago
Phrase structure detection in dance
This paper deals with phrase structure detection in contemporary western dance. Phrases are a sequence of movements that exist at semantic abstraction than gestures. The problem i...
Vidyarani M. Dyaberi, Hari Sundaram, Jodi James, G...
FSTTCS
1992
Springer
13 years 11 months ago
Structural Average Case Complexity
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
Rainer Schuler, Tomoyuki Yamakami
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 7 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
AAAI
1992
13 years 8 months ago
Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning
It is often useful for a robot to construct a spatial representation of its environment from experiments and observations, in other words, to learn a map of its environment by exp...
Thomas Dean, Dana Angluin, Kenneth Basye, Sean P. ...
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
14 years 4 months ago
On the Cell Probe Complexity of Dynamic Membership
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KE YI, QIN ZHANG