5692 search results - page 276 / 1139 » Challenges and Unsolved Problems |
146
click to vote
ANOR
2010
15 years 6 months ago
2010
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
178
click to vote
ASC
2008
15 years 6 months ago
2008
: Discovering interesting patterns or substructures in data streams is an important challenge in data mining. Clustering algorithms are very often applied to identify single substr...
166
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...
150
click to vote
EOR
2010
15 years 6 months ago
2010
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
202
click to vote
CVIU
2006
15 years 6 months ago
2006
We explore an approach to 3D people tracking with learned motion models and deterministic optimization. The tracking problem is formulated as the minimization of a differentiable ...