Sciweavers

3758 search results - page 196 / 752
» A Complete Subsumption Algorithm
Sort
View
CVPR
2012
IEEE
13 years 4 months ago
Random walks based multi-image segmentation: Quasiconvexity results and GPU-based solutions
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
Maxwell D. Collins, Jia Xu, Leo Grady, Vikas Singh
135
Voted
EDBT
2004
ACM
155views Database» more  EDBT 2004»
16 years 2 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
102
Voted
SRDS
2006
IEEE
15 years 8 months ago
Deleting Files in the Celeste Peer-to-Peer Storage System
Celeste is a robust peer-to-peer object store built on top of a distributed hash table (DHT). Celeste is a working system, developed by Sun Microsystems Laboratories. During the d...
Gal Badishi, Germano Caronni, Idit Keidar, Raphael...
ESA
2001
Springer
110views Algorithms» more  ESA 2001»
15 years 6 months ago
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
We study the completion time of broadcast operations on static ad hoc wireless networks in presence of unpredictable and dynamical faults. Concerning oblivious fault-tolerant dist...
Andrea E. F. Clementi, Angelo Monti, Riccardo Silv...
ICLP
2001
Springer
15 years 6 months ago
On a Tabling Engine That Can Exploit Or-Parallelism
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing solutions to goals. Quite a few interesting applications of tabling...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...