Sciweavers

387 search results - page 43 / 78
» Reasoning About Approximate Match Query Results
Sort
View
AIR
2006
124views more  AIR 2006»
13 years 8 months ago
Expressiveness of temporal query languages: on the modelling of intervals, interval relationships and states
Abstract Storing and retrieving time-related information are important, or even critical, tasks on many areas of Computer Science (CS) and in particular for Artificial Intelligence...
Rodolfo Sabás Gómez, Juan Carlos Aug...
CN
2000
107views more  CN 2000»
13 years 8 months ago
Query routing for Web search engines: architecture and experiments
General-purpose search engines such as AltaVista and Lycos are notorious for returning irrelevant results in response to user queries. Consequently, thousands of specialized, topi...
Atsushi Sugiura, Oren Etzioni
SIGIR
1999
ACM
14 years 29 days ago
Content-Based Retrieval for Music Collections
A content-based retrieval model for tackling the mismatch problems specific to music data is proposed and implemented. The system uses a pitch profile encoding for queries in any ...
Yuen-Hsien Tseng
ICLP
2007
Springer
14 years 16 days ago
Web Sites Verification: An Abductive Logic Programming Tool
We present the CIFFWEB system, an innovative tool for the verification of web sites, relying upon abductive logic programming. The system allows the user to define rules that a web...
Paolo Mancarella, Giacomo Terreni, Francesca Toni
AAAI
2010
13 years 10 months ago
New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure tha...
Emma Rollon, Rina Dechter