2957 search results - page 143 / 592 » The Complexity of Polynomial-Time Approximation |
278
click to vote
ICDE
2009
IEEE
16 years 6 months ago
2009
IEEE
Given an integer k, a representative skyline contains the k skyline points that best describe the tradeoffs among different dimensions offered by the full skyline. Although this to...
177
click to vote
KDD
2005
ACM
16 years 5 months ago
2005
ACM
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
135
Voted
ADHOCNOW
2008
Springer
15 years 11 months ago
2008
Springer
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
145
Voted
COCOON
2007
Springer
15 years 11 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
125
click to vote
COLT
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...