Sciweavers

79 search results - page 8 / 16
» isaac 2009
Sort
View
ISAAC
2009
Springer
130views Algorithms» more  ISAAC 2009»
14 years 4 months ago
Counting in the Presence of Memory Faults
The faulty memory RAM presented by Finocchi and Italiano [1] is a variant of the RAM model where the content of any memory cell can get corrupted at any time, and corrupted cells c...
Gerth Stølting Brodal, Allan Grønlun...
ISAAC
2009
Springer
82views Algorithms» more  ISAAC 2009»
14 years 4 months ago
Folding a Better Checkerboard
Abstract. Folding an n × n checkerboard pattern from a square of paper that is white on one side and black on the other has been thought for several years to require a paper squar...
Erik D. Demaine, Martin L. Demaine, Goran Konjevod...
ISAAC
2009
Springer
78views Algorithms» more  ISAAC 2009»
14 years 4 months ago
Reconstructing Polygons from Scanner Data
A range-finding scanner can collect information about the shape of an (unknown) polygonal room in which it is placed. Suppose that a set of scanners returns not only a set of poin...
Therese C. Biedl, Stephane Durocher, Jack Snoeyink
ESA
2010
Springer
220views Algorithms» more  ESA 2010»
13 years 10 months ago
Data Structures for Storing Small Sets in the Bitprobe Model
abstract appeared in Proc. 24th Annual Symposium of Computational Geometry (SoCG), 2008, pp. 338-345. S. Shannigrahi and S. P. Pal, "Efficient Prufer-like Coding and Counting ...
Jaikumar Radhakrishnan, Smit Shah 0001, Saswata Sh...
ISAAC
2010
Springer
272views Algorithms» more  ISAAC 2010»
13 years 7 months ago
Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra
The concept of neighbor system, introduced by Hartvigsen (2009), is a set of integral vectors satisfying a certain combinatorial property. In this paper, we reveal the relationship...
Akiyoshi Shioura