Sciweavers

331 search results - page 43 / 67
» Approximation Algorithms for Connected Dominating Sets
Sort
View
VLDB
2007
ACM
260views Database» more  VLDB 2007»
15 years 12 months ago
Approaching the Skyline in Z Order
Given a set of multidimensional data points, skyline query retrieves a set of data points that are not dominated by any other points. This query is useful for multi-preference ana...
Ken C. K. Lee, Baihua Zheng, Huajing Li, Wang-Chie...
SOFSEM
2004
Springer
15 years 5 months ago
Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: For a fixed “forbidden submatrix” B, the question is, given an input matrix A (both A and B have ent...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...
ATAL
2007
Springer
15 years 3 months ago
A reinforcement learning based distributed search algorithm for hierarchical peer-to-peer information retrieval systems
The dominant existing routing strategies employed in peerto-peer(P2P) based information retrieval(IR) systems are similarity-based approaches. In these approaches, agents depend o...
Haizheng Zhang, Victor R. Lesser
VISUALIZATION
1999
IEEE
15 years 4 months ago
Construction of Vector Field Hierarchies
We present a method for the hierarchical representation of vector fields. Our approach is based on iterative refinement using clustering and principal component analysis. The inpu...
Bjørn Heckel, Gunther H. Weber, Bernd Haman...
IJFCS
2006
70views more  IJFCS 2006»
14 years 11 months ago
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...