8728 search results - page 394 / 1746 » On Reduct Construction Algorithms |
166
click to vote
CCCG
2008
15 years 8 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 ...
189
Voted
ALGORITHMICA
2010
15 years 7 months ago
2010
We present the first dynamic graph algorithm for recognizing interval graphs. The algorithm runs in O(n log n) worst-case time per edge deletion or edge insertion, where n is the ...
173
click to vote
CJ
2010
15 years 7 months ago
2010
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
168
click to vote
JDA
2006
15 years 6 months ago
2006
We produce an algorithm that is optimal with respect to both space and execution time to generate all the lozenge (or domino) tilings of a hole-free, general-shape domain given as...
169
click to vote
ICTAI
2005
IEEE
16 years 13 days ago
2005
IEEE
One of the major drawbacks in block-based discrete cosine transform (BDCT) is the blocking artifacts at low bit rates. In this paper, an adaptive deblocking algorithm based on Mar...