Sciweavers

467 search results - page 67 / 94
» Acceleration of Shortest Path and Constrained Shortest Path ...
Sort
View
ECCV
2010
Springer
13 years 4 months ago
An Efficient Graph Cut Algorithm for Computer Vision Problems
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
Chetan Arora, Subhashis Banerjee, Prem Kalra, S. N...
PDPTA
2007
13 years 8 months ago
Two Graph Algorithms On an Associative Computing Model
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
Mingxian Jin, Johnnie W. Baker
CORR
2011
Springer
152views Education» more  CORR 2011»
13 years 2 months ago
Topology Discovery of Sparse Random Graphs With Few Participants
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
Animashree Anandkumar, Avinatan Hassidim, Jonathan...
MOBIHOC
2001
ACM
14 years 7 months ago
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
Previously proposed sensor network data dissemination schemes require periodic low-rate flooding of data in order to allow recovery from failure. We consider constructing two kind...
Deepak Ganesan, Ramesh Govindan, Scott Shenker, De...
BIOINFORMATICS
2008
119views more  BIOINFORMATICS 2008»
13 years 7 months ago
Optimal design of thermally stable proteins
Motivation: For many biotechnological purposes, it is desirable to redesign proteins to be more structurally and functionally stable at higher temperatures. For example, chemical ...
Ryan M. Bannen, Vanitha Suresh, George N. Phillips...