Sciweavers

2219 search results - page 225 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
149
Voted
IPPS
2010
IEEE
15 years 1 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke
EC
1998
112views ECommerce» more  EC 1998»
15 years 3 months ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley
ICDCS
2010
IEEE
15 years 7 months ago
Divide and Conquer Algorithms for Publish/Subscribe Overlay Design
Abstract—Overlay network design for topic-based publish/subscribe systems is of primary importance because the overlay directly impacts the system’s performance. Determining a ...
Chen Chen, Hans-Arno Jacobsen, Roman Vitenberg
ICDE
2010
IEEE
260views Database» more  ICDE 2010»
16 years 3 months ago
Anonymizing Weighted Social Network Graphs
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...
Sudipto Das, Ömer Egecioglu, Amr El Abbadi
CVPR
2008
IEEE
16 years 5 months ago
A recursive filter for linear systems on Riemannian manifolds
We present an online, recursive filtering technique to model linear dynamical systems that operate on the state space of symmetric positive definite matrices (tensors) that lie on...
Ambrish Tyagi, James W. Davis