297 search results - page 29 / 60 » Every Sequence Is Decompressible from a Random One |
136
click to vote
PADL
2012
Springer
13 years 8 months ago
2012
Springer
We begin with a functional reactive programming (FRP) model in which every program is viewed as a signal function that converts a stream of input values into a stream of output va...
108
click to vote
SIGECOM
2008
ACM
15 years 13 days ago
2008
ACM
We study the question of how to easily recognize whether a social unction f from an abstract type space to a set of outcomes is truthful, i.e. implementable by a truthful mechanis...
111
Voted
ILP
2005
Springer
15 years 6 months ago
2005
Springer
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
119
click to vote
KDD
2008
ACM
16 years 28 days ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
112
Voted
ISBI
2002
IEEE
16 years 1 months ago
2002
IEEE
We propose a new global registration method for estimating the cardiac displacement field in 2D sequences of ultrasound images of the heart. The basic idea is to select a referenc...