1197 search results - page 176 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
181
click to vote
CVPR
2007
IEEE
16 years 7 months ago
2007
IEEE
A good distance metric is crucial for unsupervised learning from high-dimensional data. To learn a metric without any constraint or class label information, most unsupervised metr...
170
click to vote
DATE
2009
IEEE
16 years 18 days ago
2009
IEEE
— In this paper, we propose a novel, energy aware scheduling algorithm for applications running on DVS-enabled multiprocessor systems, which exploits variation in execution times...
154
click to vote
ALENEX
2007
15 years 7 months ago
2007
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
178
click to vote
FSTTCS
2009
Springer
15 years 10 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...
144
click to vote
MMAS
2010
Springer
15 years 18 days ago
2010
Springer
In this paper, we introduce a new nonlinear evolution partial differential equation for sparse deconvolution problems. The proposed PDE has the form of continuity equation that ar...