Sciweavers

402 search results - page 52 / 81
» A branch and cut algorithm for the Steiner problem in graphs
Sort
View
ENDM
2010
103views more  ENDM 2010»
13 years 4 months ago
Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets
In this paper we consider the structural analysis problem for differential-algebraic systems with conditional equations. This consists, given a conditional differential algebraic ...
Mathieu Lacroix, Ali Ridha Mahjoub, Sébasti...
ICCAD
2009
IEEE
151views Hardware» more  ICCAD 2009»
13 years 5 months ago
GREMA: Graph reduction based efficient mask assignment for double patterning technology
Double patterning technology (DPT) has emerged as the most hopeful candidate for the next technology node of the ITRS roadmap [1]. The goal of a DPT decomposer is to decompose the...
Yue Xu, Chris Chu

Publication
200views
12 years 6 months ago
Tracking Endocardial Motion via Multiple Model Filtering of Distribution Cut
Tracking heart motion plays an essential role in the diagnosis of cardiovascular diseases. As such, accurate characterization of dynamic behavior of the left ventricle (LV) is esse...
Kumaradevan Punithakumar, Ismail Ben Ayed, Ali Isl...
PR
2008
170views more  PR 2008»
13 years 6 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...
COLING
2008
13 years 8 months ago
Exploiting Graph Structure for Accelerating the Calculation of Shortest Paths in Wordnets
This paper presents an approach for substantially reducing the time needed to calculate the shortest paths between all concepts in a wordnet. The algorithm exploits the unique &qu...
Holger Wunsch