Sciweavers

193 search results - page 34 / 39
» Exponential lower bounds for the numbers of Skolem-type sequ...
Sort
View
ICCV
2005
IEEE
14 years 9 months ago
Globally Optimal Estimates for Geometric Reconstruction Problems
We introduce a framework for computing statistically optimal estimates of geometric reconstruction problems. While traditional algorithms often suffer from either local minima or ...
Fredrik Kahl, Didier Henrion
CHI
2007
ACM
14 years 7 months ago
Pressure marks
Selections and actions in GUI's are often separated ? i.e. an action or command typically follows a selection. This sequence imposes a lower bound on the interaction time tha...
Gonzalo A. Ramos, Ravin Balakrishnan
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
14 years 2 months ago
Three Results on Frequency Assignment in Linear Cellular Networks
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
Marek Chrobak, Jiri Sgall
ESCAPE
2007
Springer
228views Algorithms» more  ESCAPE 2007»
14 years 1 months ago
Online Capacitated Interval Coloring
Abstract. In the online capacitated interval coloring problem, a sequence of requests arrive online. Each of the requests is an interval Ij ⊆ {1, 2, . . . , n} with bandwidth bj....
Leah Epstein, Thomas Erlebach, Asaf Levin
ICALP
2007
Springer
14 years 1 months ago
Checking and Spot-Checking the Correctness of Priority Queues
We revisit the problem of memory checking considered by Blum et al. [3]. In this model, a checker monitors the behavior of a data structure residing in unreliable memory given an a...
Matthew Chu, Sampath Kannan, Andrew McGregor