Sciweavers

3758 search results - page 341 / 752
» A Complete Subsumption Algorithm
Sort
View
EDBT
2008
ACM
103views Database» more  EDBT 2008»
16 years 6 months ago
A stratified approach to progressive approximate joins
Users often do not require a complete answer to their query but rather only a sample. They expect the sample to be either the largest possible or the most representative (or both)...
Wee Hyong Tok, Stéphane Bressan, Mong-Li Le...
DASFAA
2009
IEEE
133views Database» more  DASFAA 2009»
16 years 1 months ago
Probabilistic Ranking in Uncertain Vector Spaces
Abstract. In many application domains, e.g. sensor databases, traffic management or recognition systems, objects have to be compared based on positionally and existentially uncert...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...
SC
2009
ACM
16 years 1 months ago
Supporting fault-tolerance for time-critical events in distributed environments
In this paper, we consider the problem of supporting fault tolerance for adaptive and time-critical applications in heterogeneous and unreliable grid computing environments. Our g...
Qian Zhu, Gagan Agrawal
ICRA
2009
IEEE
134views Robotics» more  ICRA 2009»
16 years 1 months ago
Combining search and action for mobile robots
— We explore the interconnection between search and action in the context of mobile robotics. The task of searching for an object and then performing some action with that object...
Geoffrey Hollinger, Dave Ferguson, Siddhartha Srin...
HICSS
2008
IEEE
199views Biometrics» more  HICSS 2008»
16 years 1 months ago
Clustering and the Biclique Partition Problem
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
Doina Bein, Linda Morales, Wolfgang W. Bein, C. O....