Sciweavers

384 search results - page 60 / 77
» The Number of Generalized Balanced Lines
Sort
View
ICDE
2010
IEEE
322views Database» more  ICDE 2010»
14 years 7 months ago
XML-Based Computation for Scientific Workflows
Scientific workflows are increasingly used for rapid integration of existing algorithms to form larger and more comgrams. Such workflows promise to provide more abstract, yet execu...
Bertram Ludäscher, Daniel Zinn, Shawn Bowers
IPSN
2007
Springer
14 years 1 months ago
Object tracking in the presence of occlusions via a camera network
This paper describes a sensor network approach to tracking a single object in the presence of static and moving occluders using a network of cameras. To conserve communication ban...
Ali Ozer Ercan, Abbas El Gamal, Leonidas J. Guibas
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
13 years 9 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
14 years 8 months ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum
EDBT
2009
ACM
184views Database» more  EDBT 2009»
14 years 2 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer