5169 search results - page 916 / 1034 » Locality approximation using time |
131
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
133
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
157
click to vote
GRID
2006
Springer
15 years 3 months ago
2006
Springer
Discovery of large amounts of idle CPUs in fully distributed and shared Grid systems is needed in relevant applications and is still a challenging problem. In this paper we present...
138
Voted
IJON
2008
15 years 3 months ago
2008
Convolutive mixtures of images are common in photography of semi-reflections. They also occur in microscopy and tomography. Their formation process involves focusing on an object ...
136
Voted
HEURISTICS
2006
15 years 3 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...