4110 search results - page 92 / 822 » Efficient algorithms for the 2-gathering problem |
126
click to vote
CCCG
2008
15 years 5 months ago
2008
We define a class of algorithms for constructing coresets of (geometric) data sets, and show that algorithms in this class can be dynamized efficiently in the insertiononly (data ...
126
click to vote
CCCG
2008
15 years 5 months ago
2008
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
132
click to vote
SIAMCOMP
2002
15 years 3 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
151
Voted
IFIP12
2008
15 years 5 months ago
2008
Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unse...
108
click to vote
DCC
2006
IEEE
15 years 7 months ago
2006
IEEE
Abstract. We address the problem of designing optimal prefix-free codes over an encoding alphabet with unequal integer letter costs. The most efficient algorithm proposed so far ha...