Sciweavers

6142 search results - page 638 / 1229
» The Complexity of Partition Functions
Sort
View
ALGORITHMICA
2010
92views more  ALGORITHMICA 2010»
15 years 7 months ago
Quantum Separation of Local Search and Fixed Point Computation
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
Xi Chen, Xiaoming Sun, Shang-Hua Teng
BMCBI
2008
111views more  BMCBI 2008»
15 years 7 months ago
MLIP: using multiple processors to compute the posterior probability of linkage
Background: Localization of complex traits by genetic linkage analysis may involve exploration of a vast multidimensional parameter space. The posterior probability of linkage (PP...
Manika Govil, Alberto Maria Segre, Veronica J. Vie...
ENTCS
2007
115views more  ENTCS 2007»
15 years 7 months ago
Self Management and the Future of Software Design
Most software is fragile: even the slightest error, such as changing a single bit, can make it crash. As software complexity has increased, development techniques have kept pace t...
Peter Van Roy
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
15 years 7 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl
CGA
1998
15 years 6 months ago
Verbs and Adverbs: Multidimensional Motion Interpolation
This paper describes methods and data structures used to leverage motion sequences of complex linked figures. We present a technique for interpolating between example motions der...
Charles Rose, Michael F. Cohen, Bobby Bodenheimer