3946 search results - page 318 / 790 » The computational complexity of choice sets |
182
click to vote
ESCIENCE
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...
196
Voted
FGCS
2007
15 years 6 months ago
2007
In this paper we present CAMELotGrid, a tool to manage Grid computations of Cellular Automata that support the efficient simulation of complex systems modeled by a very large numb...
188
click to vote
ICCV
2005
IEEE
16 years 8 months ago
2005
IEEE
This paper presents a new surface content completion framework that can restore both shape and appearance from scanned, incomplete point set inputs. First, the geometric holes can...
195
click to vote
GRID
2007
Springer
16 years 29 days ago
2007
Springer
— Scientific applications often perform complex computational analyses that consume and produce large data sets. We are concerned with data placement policies that distribute dat...
200
click to vote
ECCV
1998
Springer
16 years 8 months ago
1998
Springer
Abstract. We show that we can e ectively t arbitrarily complex animation models to noisy image data. Our approach is based on leastsquares adjustment using of a set of progressivel...