2254 search results - page 235 / 451 » Computing the minimal covering set |
191
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
147
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
The computational complexity of current visual categorization algorithms scales linearly at best with the number of categories. The goal of classifying simultaneously Ncat = 104 -...
174
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
Nearest neighbor classification assumes locally constant class conditional probabilities. This assumption becomes invalid in high dimensions due to the curse-ofdimensionality. Sev...
159
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
Abstract. We apply tools coming from singularity theory, as Hamburger-Noether expansions, and from valuation theory, as generating sequences, to explicitly describe order functions...
192
click to vote
DAC
1997
ACM
15 years 10 months ago
1997
ACM
We present a system-level approach for power optimization under a set of user specified costs and timing constraints of hard real-time designs. The approach optimizes all three d...