Sciweavers

387 search results - page 22 / 78
» Reasoning About Approximate Match Query Results
Sort
View
DASFAA
2011
IEEE
251views Database» more  DASFAA 2011»
13 years 5 days ago
Towards Web Search by Sentence Queries: Asking the Web for Query Substitutions
In this paper, we propose a method to search the Web for sentence substitutions for a given sentence query. Our method uses only lexico-syntactic patterns dynamically generated fro...
Yusuke Yamamoto, Katsumi Tanaka
DAGSTUHL
1998
13 years 10 months ago
A Practical Approach to Hypothetical Database Queries
Hypothetical queries are queries embedding hypotheses about the database. The embedded hypothesis in a hypothetical query indicates, so to say, a state of the database intended for...
Henning Christiansen, Troels Andreasen
ICDT
2009
ACM
166views Database» more  ICDT 2009»
14 years 9 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
P2P
2008
IEEE
14 years 3 months ago
P2P Information Retrieval and Filtering with MAPS
In this demonstration paper we present MAPS, a novel system that combines approximate information retrieval and filtering functionality in a peer-to-peer setting. In MAPS, a user...
Christian Zimmer, Johannes Heinz, Christos Tryfono...
CCS
2006
ACM
14 years 12 days ago
Evading network anomaly detection systems: formal reasoning and practical techniques
Attackers often try to evade an intrusion detection system (IDS) when launching their attacks. There have been several published studies in evasion attacks, some with available to...
Prahlad Fogla, Wenke Lee