2107 search results - page 212 / 422 » Computing Small Search Numbers in Linear Time |
143
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance from a given input function. The result is achieved...
167
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
151
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
Recent years have witnessed a dramatic increase in the quantity of image data collected, due to advances in fields such as medical imaging, reconnaissance, surveillance, astronomy...
148
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
138
click to vote
CGF
2008
15 years 4 months ago
2008
Existing solid texture synthesis algorithms generate a full volume of color content from a set of 2D example images. We introduce a new algorithm with the unique ability to restri...