Sciweavers

204 search results - page 40 / 41
» Probabilistic Attributed Hashing
Sort
View
ECCC
2007
122views more  ECCC 2007»
13 years 5 months ago
Infeasibility of Instance Compression and Succinct PCPs for NP
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
Lance Fortnow, Rahul Santhanam
SIGMOD
2008
ACM
169views Database» more  SIGMOD 2008»
14 years 5 months ago
MCDB: a monte carlo approach to managing uncertain data
To deal with data uncertainty, existing probabilistic database systems augment tuples with attribute-level or tuple-level probability values, which are loaded into the database al...
Ravi Jampani, Fei Xu, Mingxi Wu, Luis Leopoldo Per...
INFOCOM
2005
IEEE
13 years 11 months ago
BARD: Bayesian-assisted resource discovery in sensor networks
Data dissemination in sensor networks requires four components: resource discovery, route establishment, packet forwarding, and route maintenance. Resource discovery can be the mos...
Fred Stann, John S. Heidemann
IBPRIA
2003
Springer
13 years 10 months ago
A Colour Tracking Procedure for Low-Cost Face Desktop Applications
In this paper we present an environment for the tracking of a human face obtained from a real video sequence. We will describe the system and discuss the advantages and disadvanta...
Francisco J. Perales López, Ramon Mas, Miqu...
CGF
2011
12 years 9 months ago
Prior Knowledge for Part Correspondence
Classical approaches to shape correspondence base their computation purely on the properties, in particular geometric similarity, of the shapes in question. Their performance stil...
Oliver van Kaick, Andrea Tagliasacchi, Oana Sidi, ...