Sciweavers

13987 search results - page 684 / 2798
» The Two Guards Problem
Sort
View
SODA
2003
ACM
158views Algorithms» more  SODA 2003»
15 years 8 months ago
Comparing top k lists
Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of...
Ronald Fagin, Ravi Kumar, D. Sivakumar
SODA
2003
ACM
102views Algorithms» more  SODA 2003»
15 years 8 months ago
Online paging with arbitrary associativity
We tackle the problem of online paging on two level memories with arbitrary associativity (including victim caches, skewed caches etc.). We show that some important classes of pag...
Enoch Peserico
MM
2010
ACM
208views Multimedia» more  MM 2010»
15 years 7 months ago
A new approach to cross-modal multimedia retrieval
The problem of joint modeling the text and image components of multimedia documents is studied. The text component is represented as a sample from a hidden topic model, learned wi...
Nikhil Rasiwasia, Jose Costa Pereira, Emanuele Cov...
BC
2006
132views more  BC 2006»
15 years 7 months ago
Local visual homing by matched-filter descent in image distances
Abstract In natural images, the distance measure between two images taken at different locations rises smoothly with increasing distance between the locations. This fact can be exp...
Ralf Möller, Andrew Vardy
CORR
2002
Springer
117views Education» more  CORR 2002»
15 years 7 months ago
Detecting Race Conditions in Parallel Programs that Use Semaphores
Abstract. We address the problem of detecting race conditions in programs that use semaphores for synchronization. Netzer and Miller showed that it is NP-complete to detect race co...
Philip N. Klein, Hsueh-I Lu, Robert H. B. Netzer