2370 search results - page 138 / 474 » The Characterization of Data-Accumulating Algorithms |
131
Voted
ESA
2009
Springer
15 years 10 months ago
2009
Springer
We consider the problem of coloring a grid using k colors with the restriction that in each row and each column has an specific number of cells of each color. In an already classi...
101
Voted
DAGM
2007
Springer
15 years 10 months ago
2007
Springer
We propose an unsupervised “local learning” algorithm for learning a metric in the input space. Geometrically, for a given query point, the algorithm finds the minimum volume ...
153
click to vote
ISCAS
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper we present two polynomial time-complexity heuristic algorithms for optimization of gate-oxide leakage (tunneling current) during behavioral synthesis through simulta...
133
Voted
KES
2005
Springer
15 years 9 months ago
2005
Springer
This paper discusses a general algorithm for the discovery of motif combinations. From a large number of input motifs, discovered by any single motif discovery tool, our algorithm ...
146
click to vote
PCM
2004
Springer
15 years 9 months ago
2004
Springer
Face tracking in realistic environments is a difficult problem due to pose variations, occlusions of objects, illumination changes and cluttered background, among others. The paper...