Sciweavers

1688 search results - page 101 / 338
» The Complexity of Rationalizing Matchings
Sort
View
FOCS
2008
IEEE
14 years 4 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
ICDE
2002
IEEE
130views Database» more  ICDE 2002»
14 years 11 months ago
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
Shurug Al-Khalifa, H. V. Jagadish, Jignesh M. Pate...
LATA
2009
Springer
14 years 5 months ago
Matching Trace Patterns with Regular Policies
Abstract. We consider policies that are described by regular expressions, finite automata, or formulae of linear temporal logic (LTL). Such policies are assumed to describe situat...
Franz Baader, Andreas Bauer 0002, Alwen Tiu
IRI
2008
IEEE
14 years 4 months ago
Biological question answering with syntactic and semantic feature matching and an improved mean reciprocal ranking measurement
Specific information on biomolecular events such as protein-protein and gene-protein interactions is essential for molecular biology researchers. However, the results derived by c...
Ryan T. K. Lin, Justin Liang-Te Chiu, Hong-Jie Dai...
ECOWS
2007
Springer
14 years 4 months ago
Service selection by choreography-driven matching
Abstract. The greater and greater quantity of services that are available over the web causes a growing attention to techniques that facilitate their reuse. A web service specific...
Matteo Baldoni, Cristina Baroglio, Alberto Martell...