Sciweavers

6266 search results - page 1217 / 1254
» New results on the computability and complexity of points - ...
Sort
View
SENSYS
2006
ACM
14 years 1 months ago
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
Nisheeth Shrivastava, Raghuraman Mudumbai, Upamany...
GD
2005
Springer
14 years 1 months ago
D-Dupe: An Interactive Tool for Entity Resolution in Social Networks
Visualizing and analyzing social networks is a challenging problem that has been receiving growing attention. An important first step, before analysis can begin, is ensuring that...
Mustafa Bilgic, Louis Licamele, Lise Getoor, Ben S...
TACAS
2005
Springer
108views Algorithms» more  TACAS 2005»
14 years 1 months ago
On Some Transformation Invariants Under Retiming and Resynthesis
Transformations using retiming and resynthesis operations are the most important and practical (if not the only) techniques used in optimizing synchronous hardware systems. Althoug...
Jie-Hong Roland Jiang
MM
2004
ACM
106views Multimedia» more  MM 2004»
14 years 1 months 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...
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
13 years 12 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
« Prev « First page 1217 / 1254 Last » Next »