Sciweavers

3172 search results - page 18 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
CACM
2008
65views more  CACM 2008»
15 years 5 months ago
Scene completion using millions of photographs
What can you do with a million images? In this paper we present a new image completion algorithm powered by a huge database of photographs gathered from the Web. The algorithm pat...
James Hays, Alexei A. Efros
TPDS
1998
124views more  TPDS 1998»
15 years 6 months ago
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
Lars Lundberg, Håkan Lennerstad
ICFP
2003
ACM
16 years 6 months ago
A sound and complete axiomatization of delimited continuations
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
Yukiyoshi Kameyama, Masahito Hasegawa
FOSSACS
2010
Springer
16 years 1 months ago
Completeness for Algebraic Theories of Local State
Every algebraic theory gives rise to a monad, and monads allow a meta-language which is a basic programming language with sideeffects. Equations in the algebraic theory give rise ...
Sam Staton
LPAR
2007
Springer
16 years 24 days ago
Completeness and Decidability in Sequence Logic
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...
Marc Bezem, Tore Langholm, Michal Walicki