Sciweavers

807 search results - page 45 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
SIGMOD
2005
ACM
145views Database» more  SIGMOD 2005»
16 years 4 months ago
Stratified Computation of Skylines with Partially-Ordered Domains
In this paper, we study the evaluation of skyline queries with partially-ordered attributes. Because such attributes lack a total ordering, traditional index-based evaluation algo...
Chee Yong Chan, Pin-Kwang Eng, Kian-Lee Tan
PODC
2009
ACM
16 years 4 months ago
Brief announcement: minimum spanning trees and cone-based topology control
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
Alejandro Cornejo, Nancy A. Lynch
CIKM
2006
Springer
15 years 7 months ago
Approximate reverse k-nearest neighbor queries in general metric spaces
In this paper, we propose an approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our method uses an approx...
Elke Achtert, Christian Böhm, Peer Kröge...
RECOMB
2008
Springer
16 years 4 months ago
Computation of Median Gene Clusters
Whole genome comparison based on gene order has become a popular approach in comparative genomics. An important task in this field is the detection of gene clusters, i.e. sets of g...
Sebastian Böcker, Katharina Jahn, Julia Mixta...
CP
2009
Springer
16 years 4 months ago
Search Spaces for Min-Perturbation Repair
Many problems require minimally perturbing an initial state in order to repair some violated constraints. We consider two search spaces for exactly solving this minimal perturbatio...
Alex S. Fukunaga