Sciweavers

986 search results - page 109 / 198
» Algorithmic Lower Bounds for Problems Parameterized by Cliqu...
Sort
View
CGF
2000
81views more  CGF 2000»
15 years 3 months ago
Generating Consistent Motion Transition via Decoupled Framespace Interpolation
espace interpolation algorithm abstracts motion sequences as 1D signals, and interpolates between them to create higher dimension signals, with weights drawn from a user specified...
Golam Ashraf, Kok Cheong Wong
ESA
2004
Springer
160views Algorithms» more  ESA 2004»
15 years 9 months ago
Optimal External Memory Planar Point Enclosure
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
Lars Arge, Vasilis Samoladas, Ke Yi
123
Voted
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
16 years 4 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
155
Voted
AI
2010
Springer
15 years 4 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
SPAA
2009
ACM
16 years 1 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...