Sciweavers

1887 search results - page 29 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
RECOMB
2006
Springer
14 years 8 months ago
Inferring Gene Orders from Gene Maps Using the Breakpoint Distance
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
Guillaume Blin, Eric Blais, Pierre Guillon, Mathie...
AI
2007
Springer
13 years 7 months ago
Determining the consistency of partial tree descriptions
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...
Manuel Bodirsky, Martin Kutz
ICDE
2008
IEEE
204views Database» more  ICDE 2008»
14 years 9 months ago
Keyword Search on Spatial Databases
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
Ian De Felipe, Vagelis Hristidis, Naphtali Rishe
ICDE
2006
IEEE
150views Database» more  ICDE 2006»
14 years 9 months ago
Efficient Aggregation of Ranked Inputs
A top-k query combines different rankings of the same set of objects and returns the k objects with the highest combined score according to an aggregate function. We bring to ligh...
Nikos Mamoulis, Kit Hung Cheng, Man Lung Yiu, Davi...
SIGMOD
2003
ACM
152views Database» more  SIGMOD 2003»
14 years 7 months ago
Using Sets of Feature Vectors for Similarity Search on Voxelized CAD Objects
In modern application domains such as multimedia, molecular biology and medical imaging, similarity search in database systems is becoming an increasingly important task. Especial...
Hans-Peter Kriegel, Stefan Brecheisen, Peer Kr&oum...