Sciweavers

4926 search results - page 449 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
CIBCB
2007
IEEE
15 years 10 months ago
Evolving Extremal Epidemic Networks
The susceptible, infected, removed model for epidemics assumes that the population in which the epidemic takes place is well mixed. This strong assumption can be relaxed by permit...
Dan Ashlock, Fatemeh Jafargholi
MICCAI
2004
Springer
16 years 5 months ago
Automatic Heart Peripheral Vessels Segmentation Based on a Normal MIP Ray Casting Technique
This paper introduces a new technique to detect the coronary arteries as well as other heart's peripheral vessels. After finding the location of the myocardium through a graph...
Charles Florin, Romain Moreau-Gobard, James Willia...
ICCAD
1994
IEEE
117views Hardware» more  ICCAD 1994»
15 years 8 months ago
Optimization of critical paths in circuits with level-sensitive latches
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
Timothy M. Burks, Karem A. Sakallah
CVPR
2007
IEEE
16 years 6 months ago
Enhanced Level Building Algorithm for the Movement Epenthesis Problem in Sign Language Recognition
One of the hard problems in automated sign language recognition is the movement epenthesis (me) problem. Movement epenthesis is the gesture movement that bridges two consecutive s...
Ruiduo Yang, Sudeep Sarkar, Barbara L. Loeding
DIALM
2008
ACM
139views Algorithms» more  DIALM 2008»
15 years 5 months ago
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
Zeev Nutov