Sciweavers

1064 search results - page 166 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
VIS
2003
IEEE
145views Visualization» more  VIS 2003»
16 years 5 months ago
Signed Distance Transform Using Graphics Hardware
This paper presents a signed distance transform algorithm using graphics hardware, which computes the scalar valued function of the Euclidean distance to a given manifold of co-di...
Christian Sigg, Markus H. Gross, Ronald Peikert
IANDC
2008
92views more  IANDC 2008»
15 years 4 months ago
Tree exploration with advice
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
ICML
2009
IEEE
16 years 4 months ago
Bandit-based optimization on graphs with application to library performance tuning
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
Arpad Rimmel, Frédéric de Mesmay, Ma...
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 3 months ago
Polynomial Filtering for Fast Convergence in Distributed Consensus
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
Effrosini Kokiopoulou, Pascal Frossard
IPL
2010
114views more  IPL 2010»
15 years 2 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer