Sciweavers

4894 search results - page 592 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
CHI
2008
ACM
16 years 4 months ago
Rapid image analysis using neural signals
The problem of extracting information from large collections of imagery is a challenge with few good solutions. Computers typically cannot interpret imagery as effectively as huma...
Santosh Mathan, Deniz Erdogmus, Yonghong Huang, Mi...
STOC
2004
ACM
126views Algorithms» more  STOC 2004»
16 years 4 months ago
Bypassing the embedding: algorithms for low dimensional metrics
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
Kunal Talwar
EDBT
2006
ACM
182views Database» more  EDBT 2006»
16 years 4 months ago
On High Dimensional Skylines
In many decision-making applications, the skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset. In a high-...
Chee Yong Chan, H. V. Jagadish, Kian-Lee Tan, Anth...
EDBT
2008
ACM
111views Database» more  EDBT 2008»
16 years 4 months ago
On-line discovery of hot motion paths
We consider an environment of numerous moving objects, equipped with location-sensing devices and capable of communicating with a central coordinator. In this setting, we investig...
Dimitris Sacharidis, Kostas Patroumpas, Manolis Te...
124
Voted
DCC
2004
IEEE
16 years 4 months ago
On the Entropy of a Hidden Markov Process
We study the entropy rate of a hidden Markov process (HMP) defined by observing the output of a binary symmetric channel whose input is a first-order binary Markov process. Despit...
Philippe Jacquet, Gadiel Seroussi, Wojciech Szpank...