Sciweavers

4 search results - page 1 / 1
» Trade-Off Lower Bounds for Stack Machines
Sort
View
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
13 years 6 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou
DLT
2008
13 years 6 months ago
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
We consider multi-pushdown automata, a multi-stack extension of pushdown automata that comes with a constraint on stack operations: a pop can only be performed on the first non-emp...
Mohamed Faouzi Atig, Benedikt Bollig, Peter Haberm...
GBRPR
2007
Springer
13 years 11 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
OPODIS
2010
13 years 2 months ago
An Adaptive Technique for Constructing Robust and High-Throughput Shared Objects
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...
Danny Hendler, Shay Kutten, Erez Michalak