Sciweavers

1668 search results - page 264 / 334
» Two Philosophical Applications of Algorithmic Information Th...
Sort
View
PLDI
2010
ACM
14 years 5 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
SDM
2010
SIAM
153views Data Mining» more  SDM 2010»
13 years 9 months ago
The Generalized Dimensionality Reduction Problem
The dimensionality reduction problem has been widely studied in the database literature because of its application for concise data representation in a variety of database applica...
Charu C. Aggarwal
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
13 years 5 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
ICML
2004
IEEE
14 years 9 months ago
Distribution kernels based on moments of counts
Many applications in text and speech processing require the analysis of distributions of variable-length sequences. We recently introduced a general kernel framework, rational ker...
Corinna Cortes, Mehryar Mohri
MOBIHOC
2007
ACM
14 years 7 months ago
Outlier detection in sensor networks
Outlier detection has many important applications in sensor networks, e.g., abnormal event detection, animal behavior change, etc. It is a difficult problem since global informati...
Bo Sheng, Qun Li, Weizhen Mao, Wen Jin