Sciweavers

605 search results - page 5 / 121
» Normalizers and Split Extensions
Sort
View
PR
2008
170views more  PR 2008»
14 years 10 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
FOCS
1997
IEEE
15 years 2 months ago
The Computational Complexity of Knot and Link Problems
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
Joel Hass, J. C. Lagarias, Nicholas Pippenger
DAC
2000
ACM
15 years 11 months ago
To split or to conjoin: the question in image computation
Image computation is the key step in fixpoint computations that are extensively used in model checking. Two techniques have been used for this step: one based on conjunction of the...
In-Ho Moon, James H. Kukula, Kavita Ravi, Fabio So...
EOR
2006
75views more  EOR 2006»
14 years 10 months ago
A rolling stock circulation model for combining and splitting of passenger trains
This paper addresses the railway rolling stock circulation problem. Given the departure and arrival times as well as the expected numbers of passengers, we have to assign the roll...
Pieter-Jan Fioole, Leo G. Kroon, Gábor Mar&...
CVPR
2005
IEEE
16 years 19 days ago
Segmentation of Edge Preserving Gradient Vector Flow: An Approach Toward Automatically Initializing and Splitting of Snakes
Active contours or snakes have been extensively utilized in handling image segmentation and classification problems. In traditional active contour models, snake initialization is ...
Chunming Li, Jundong Liu, Martin D. Fox