Sciweavers

1888 search results - page 244 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
ICALP
1994
Springer
15 years 7 months ago
Simple Fast Parallel Hashing
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
Joseph Gil, Yossi Matias
147
Voted
VLDB
1989
ACM
104views Database» more  VLDB 1989»
15 years 7 months ago
Event-Join Optimization in Temporal Relational Databases
An Event-Join combinestemporaljoin and outerjoin properties into a single operation. It is mostly used to group temporal attributes of an entity into a single relation. In this pa...
Arie Segev, Himawan Gunadhi
105
Voted
CORR
2006
Springer
149views Education» more  CORR 2006»
15 years 3 months ago
Synonym search in Wikipedia: Synarcher
The program Synarcher for synonym (and related terms) search in the text corpus of special structure (Wikipedia) was developed. The results of the search are presented in the form...
Andrew Krizhanovsky
141
Voted
BIBE
2007
IEEE
169views Bioinformatics» more  BIBE 2007»
15 years 9 months ago
Combining Semantics, Context, and Statistical Evidence in Genomics Literature Search
—We present an information retrieval model for combining evidence from concept-based semantics, term statistics, and context for improving search precision of genomics literature...
Jay Urbain, Nazli Goharian, Ophir Frieder
ALGORITHMICA
2011
14 years 10 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal