Sciweavers

597 search results - page 46 / 120
» Homomorphisms of random paths
Sort
View
ICCV
2009
IEEE
1714views Computer Vision» more  ICCV 2009»
15 years 3 months ago
Power watersheds: a new image segmentation framework extending graph cuts, random walker and optimal spanning forest
In this work, we extend a common framework for seeded image segmentation that includes the graph cuts, ran- dom walker, and shortest path optimization algorithms. Viewing an ima...
Camille Couprie, Leo Grady, Laurent Najman, Hugues...
BMCBI
2006
137views more  BMCBI 2006»
13 years 10 months ago
Cell_motility: a cross-platform, open source application for the study of cell motion paths
Background: Migration is an important aspect of cellular behaviour and is therefore widely studied in cell biology. Numerous components are known to participate in this process in...
Lennart Martens, Geert Monsieur, Christophe Ampe, ...
EOR
2006
107views more  EOR 2006»
13 years 10 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...
HPDC
2006
IEEE
14 years 4 months ago
Path Grammar Guided Trace Compression and Trace Approximation
Trace-driven simulation is an important technique used in the evaluation of computer architecture innovations. However using it for studying parallel computers and applications is...
Xiaofeng Gao, Allan Snavely, Larry Carter
STOC
2002
ACM
144views Algorithms» more  STOC 2002»
14 years 10 months ago
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
Surender Baswana, Ramesh Hariharan, Sandeep Sen