Sciweavers

7315 search results - page 1277 / 1463
» Peer-to-Peer Information Search
Sort
View
NLDB
2005
Springer
14 years 1 months ago
On Some Optimization Heuristics for Lesk-Like WSD Algorithms
For most English words, dictionaries give various senses: e.g., “bank” can stand for a financial institution, shore, set, etc. Automatic selection of the sense intended in a gi...
Alexander F. Gelbukh, Grigori Sidorov, Sang-Yong H...
PCI
2005
Springer
14 years 1 months ago
Closest Pair Queries with Spatial Constraints
Abstract. Given two datasets DA and DB the closest-pair query (CPQ) retrieves the pair (a,b), where a ∈ DA and b ∈ DB, having the smallest distance between all pairs of objects...
Apostolos N. Papadopoulos, Alexandros Nanopoulos, ...
PCM
2005
Springer
152views Multimedia» more  PCM 2005»
14 years 1 months ago
Apollon: File System Level Support for QoS Augmented I/O
Abstract. Next generation information appliances are required to handle realtime audio/video playback and in the mean time should be able to handle text based requests such as data...
Taeseok Kim, Youjip Won, Doohan Kim, Kern Koh, Yon...
SPIRE
2005
Springer
14 years 1 months ago
Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups
Large inverted indices are by now common in the construction of web-scale search engines. For faster access, inverted indices are indexed internally so that it is possible to skip...
Paolo Boldi, Sebastiano Vigna
SPIRE
2005
Springer
14 years 1 months ago
Restricted Transposition Invariant Approximate String Matching Under Edit Distance
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...
Heikki Hyyrö
« Prev « First page 1277 / 1463 Last » Next »