Sciweavers

2303 search results - page 419 / 461
» Interior-Point Methods in Parallel Computation
Sort
View
129
Voted
IPPS
2010
IEEE
15 years 10 days ago
Stability of a localized and greedy routing algorithm
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
Christelle Caillouet, Florian Huc, Nicolas Nisse, ...
128
Voted
DCOSS
2011
Springer
14 years 2 months ago
On sensor selection in linked information networks
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...
Charu C. Aggarwal, Amotz Bar-Noy, Simon Shamoun
127
Voted
SIGGRAPH
2009
ACM
15 years 9 months ago
Spectral mesh processing
Spectral methods for mesh processing and analysis rely on the eigenvalues, eigenvectors, or eigenspace projections derived from appropriately defined mesh operators to carry out ...
Bruno Lévy, Hao Zhang 0002
ICCV
2001
IEEE
16 years 4 months ago
Noise in Bilinear Problems
: Despite the wide application of bilinear problems to problems both in computer vision and in other fields, their behaviour under the effects of noise is still poorly understood. ...
John A. Haddon, David A. Forsyth
VIS
2007
IEEE
188views Visualization» more  VIS 2007»
16 years 3 months ago
Fast Filament Tracking Using Graphics Hardware
Recent developments in biomedical imaging are producing massive data sets containing structures, such as fine filaments, that are difficult to visualize. In this paper, we describ...
David M. Mayerich, Zeki Melek, John Keyser