Sciweavers

328 search results - page 18 / 66
» Simple Termination Revisited
Sort
View
LCPC
2007
Springer
14 years 1 months ago
Revisiting SIMD Programming
Massively parallel SIMD array architectures are making their way into embedded processors. In these architectures, a number of identical processing elements having small private st...
Anton Lokhmotov, Benedict R. Gaster, Alan Mycroft,...
SIGCOMM
2006
ACM
14 years 1 months ago
Revisiting IP multicast
This paper revisits a much explored topic in networking – the search for a simple yet fully-general multicast design. The many years of research into multicast routing have led ...
Sylvia Ratnasamy, Andrey Ermolinskiy, Scott Shenke...
MCS
2007
Springer
13 years 7 months ago
Nonlinearity from linearity: The Ermakov-Pinney equation revisited
In this short note, we revisit the so-called Ermakov–Pinney (EP) equation viewing its properties from a physically motivated perspective. We discuss its ties with the Schr¨odin...
Panayotis G. Kevrekidis, Yannis Drossinos
ECCV
2006
Springer
14 years 9 months ago
Revisiting the Brightness Constraint: Probabilistic Formulation and Algorithms
Abstract. In this paper we introduce a principled approach to modeling the image brightness constraint for optical flow algorithms. Using a simple noise model, we derive a probabil...
Venu Madhav Govindu
CSL
2007
Springer
14 years 1 months ago
The Theory of Calculi with Explicit Substitutions Revisited
Calculi with explicit substitutions (ES) are widely used in different areas of computer science. Complex systems with ES were developed these last 15 years to capture the good comp...
Delia Kesner