4541 search results - page 478 / 909 » Cache-Oblivious Algorithms and Data Structures |
175
click to vote
KDD
2002
ACM
16 years 6 months ago
2002
ACM
Text clustering methods can be used to structure large sets of text or hypertext documents. The well-known methods of text clustering, however, do not really address the special p...
149
click to vote
INFOCOM
2009
IEEE
16 years 24 days ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
162
Voted
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
154
Voted
ICIP
1999
IEEE
15 years 10 months ago
1999
IEEE
by 0. In the discrete Fourier transform (DFT) domain, We propose a hybrid approach to wavelet-based image deconvolution that comprises Fourier-domain system inversion followed by w...
163
Voted
VISUALIZATION
1998
IEEE
15 years 10 months ago
1998
IEEE
Many high-performance isosurface extraction algorithms have been proposed in the past several years as a result of intensive research efforts. When applying these algorithms to la...