Sciweavers

8512 search results - page 48 / 1703
» Computing Theory With Relevance
Sort
View
WDAG
2001
Springer
122views Algorithms» more  WDAG 2001»
14 years 14 days ago
Computation Slicing: Techniques and Theory
We generalize the notion of slice introduced in our earlier paper [6]. A slice of a distributed computation with respect to a global predicate is the smallest computation that cont...
Neeraj Mittal, Vijay K. Garg
EC
1998
112views ECommerce» more  EC 1998»
13 years 7 months ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley
FLOPS
2006
Springer
13 years 11 months ago
A Computational Approach to Pocklington Certificates in Type Theory
Pocklington certificates are known to provide short proofs of primality. We show how to perform this in the framework of formal, mechanically checked, proofs. We present an encodin...
Benjamin Grégoire, Laurent Théry, Be...
ICCV
2007
IEEE
14 years 10 months ago
Graph-Cut Transducers for Relevance Feedback in Content Based Image Retrieval
Closing the semantic gap in content based image retrieval (CBIR) basically requires the knowledge of the user's intention which is usually translated into a sequence of quest...
Hichem Sahbi, Jean-Yves Audibert, Renaud Keriven