Sciweavers

2215 search results - page 134 / 443
» Wide open spaces
Sort
View
CCR
2006
117views more  CCR 2006»
14 years 10 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
CN
2007
110views more  CN 2007»
14 years 10 months ago
Stability of FIFO networks under adversarial models: State of the art
Network stability is an important issue that has attracted the attention of many researchers in recent years. Such interest comes from the need to ensure that, as the system runs ...
Vicent Cholvi, Juan Echagüe
IJCV
2006
165views more  IJCV 2006»
14 years 10 months ago
A Critical View of Context
In this study, a discriminative detector for object context is designed and tested. The context-feature is simple to implement, feed-forward, and effective across multiple object t...
Lior Wolf, Stanley M. Bileschi
JUCS
2006
87views more  JUCS 2006»
14 years 10 months ago
Eliminating Redundant Join-Set Computations in Static Single Assignment
: The seminal algorithm developed by Ron Cytron, Jeanne Ferrante and colleagues in 1989 for the placement of -nodes in a control flow graph is still widely used in commercial compi...
Angela French, José Nelson Amaral
SIAMDM
2008
90views more  SIAMDM 2008»
14 years 10 months ago
The Nine Morse Generic Tetrahedra
From computational geometry comes the notion of a Gabriel graph of a point set in the plane. The Gabriel graph consists of those edges connecting two points of the point set such t...
D. Siersma, M. van Manen