Sciweavers

3415 search results - page 534 / 683
» Lower Bounds for Kernelizations
Sort
View
DNA
2007
Springer
15 years 10 months ago
Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O (1) Glues
We introduce staged self-assembly of Wang tiles, where tiles can be added dynamically in sequence and where intermediate constructions can be stored for later mixing. This model a...
Erik D. Demaine, Martin L. Demaine, Sándor ...
DRM
2007
Springer
15 years 10 months ago
Data structures for limited oblivious execution of programs while preserving locality of reference
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
Avinash V. Varadarajan, Ramarathnam Venkatesan, C....
ESCAPE
2007
Springer
228views Algorithms» more  ESCAPE 2007»
15 years 10 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
GBRPR
2007
Springer
15 years 10 months ago
Hierarchy Construction Schemes Within the Scale Set Framework
Segmentation algorithms based on an energy minimisation framework often depend on a scale parameter which balances a fit to data and a regularising term. Irregular pyramids are de...
Jean-Hugues Pruvot, Luc Brun
ICALP
2007
Springer
15 years 10 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