Sciweavers

184 search results - page 32 / 37
» Using FPGAs to solve the Hamiltonian cycle problem
Sort
View
SPAA
2004
ACM
15 years 6 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
SIROCCO
2008
15 years 2 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 1 months ago
Approximated Structured Prediction for Learning Large Scale Graphical Models
In this paper we propose an approximated structured prediction framework for large scale graphical models and derive message-passing algorithms for learning their parameters effic...
Tamir Hazan, Raquel Urtasun
ICPR
2006
IEEE
16 years 2 months ago
Subpixel Alignment of MRI Data Under Cartesian and Log-Polar Sampling
Magnetic resonance imaging (MRI) allows numerous Fourier domain sampling schemes such as Cartesian and non-Cartesian trajectories (e.g. Polar, circular, and spherical). On the oth...
Hassan Foroosh, Mais Alnasser, Murat Balci
ISLPED
2009
ACM
184views Hardware» more  ISLPED 2009»
15 years 7 months ago
Online work maximization under a peak temperature constraint
Increasing power densities and the high cost of low thermal resistance packages and cooling solutions make it impractical to design processors for worst-case temperature scenarios...
Thidapat Chantem, Xiaobo Sharon Hu, Robert P. Dick