Sciweavers

387 search results - page 27 / 78
» Reasoning About Approximate Match Query Results
Sort
View
GIS
2004
ACM
14 years 9 months ago
Energy efficient exact kNN search in wireless broadcast environments
The advances in wireless communication and decreasing costs of mobile devices have enabled users to access desired information at any time. Coupled with positioning technologies l...
Bugra Gedik, Aameek Singh, Ling Liu
CORR
2011
Springer
215views Education» more  CORR 2011»
13 years 13 days ago
The Bethe Permanent of a Non-Negative Matrix
:  The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
Pascal O. Vontobel
PLDI
2012
ACM
11 years 11 months ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
SEMWEB
2005
Springer
14 years 2 months ago
Modeling Degrees of Conceptual Overlap in Semantic Web Ontologies
Information retrieval systems have to deal with uncertain knowledge and query results should reflect this uncertainty in some manner. However, Semantic Web ontologies are based on...
Markus Holi, Eero Hyvönen
ACL
2009
13 years 6 months ago
The Impact of Query Refinement in the Web People Search Task
Searching for a person name in a Web Search Engine usually leads to a number of web pages that refer to several people sharing the same name. In this paper we study whether it is ...
Javier Artiles, Julio Gonzalo, Enrique Amigó...