Sciweavers

2766 search results - page 163 / 554
» Algorithms for trigonometric polynomials
Sort
View
ICDE
2007
IEEE
140views Database» more  ICDE 2007»
16 years 5 months ago
Selecting Stars: The k Most Representative Skyline Operator
Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of selecting k skyline points so that the number of points,...
Xuemin Lin, Yidong Yuan, Qing Zhang, Ying Zhang
DCC
2008
IEEE
16 years 4 months ago
Sublinear Recovery of Sparse Wavelet Signals
There are two main classes of decoding algorithms for "compressed sensing," those which run time time polynomial in the signal length and those which use sublinear resou...
Ray Maleh, Anna C. Gilbert
ICCAD
2006
IEEE
126views Hardware» more  ICCAD 2006»
16 years 1 months ago
Optimizing yield in global routing
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
Dirk Müller
CSCLP
2005
Springer
15 years 9 months ago
Among, Common and Disjoint Constraints
Abstract. Among, Common and Disjoint are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and ...
Christian Bessière, Emmanuel Hebrard, Brahi...
STOC
1999
ACM
123views Algorithms» more  STOC 1999»
15 years 8 months ago
Covering Rectilinear Polygons with Axis-Parallel Rectangles
We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...
V. S. Anil Kumar, H. Ramesh