Sciweavers

1046 search results - page 102 / 210
» Approximation Algorithms for Domination Search
Sort
View
ICCAD
2005
IEEE
83views Hardware» more  ICCAD 2005»
16 years 1 min ago
Post-placement rewiring and rebuffering by exhaustive search for functional symmetries
Separate optimizations of logic and layout have been thoroughly studied in the past and are well documented for common benchmarks. However, to be competitive, modern circuit optim...
Kai-Hui Chang, Igor L. Markov, Valeria Bertacco
VLDB
2007
ACM
260views Database» more  VLDB 2007»
16 years 3 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...
CIKM
2008
Springer
15 years 5 months ago
On low dimensional random projections and similarity search
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
Yu-En Lu, Pietro Liò, Steven Hand
ICML
2008
IEEE
16 years 3 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
VLDB
2004
ACM
125views Database» more  VLDB 2004»
15 years 8 months ago
Reverse kNN Search in Arbitrary Dimensionality
Given a point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for processing such quer...
Yufei Tao, Dimitris Papadias, Xiang Lian