Sciweavers

185 search results - page 16 / 37
» A Simple Min Cut Algorithm
Sort
View
CA
2002
IEEE
14 years 15 days ago
Removing Tetrahedra from a Manifold Mesh
One of the most important task in surgical simulation is the ability to cut volumetric organs. Several algorithms have already been described but none of them can actually maintai...
Clement Forest, Hervé Delingette, Nicholas ...
ICDM
2008
IEEE
122views Data Mining» more  ICDM 2008»
14 years 2 months ago
Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
Chris H. Q. Ding, Tao Li, Michael I. Jordan
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
14 years 1 months ago
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
Markus Chimani, Maria Kandyba, Petra Mutzel
ATS
2005
IEEE
100views Hardware» more  ATS 2005»
14 years 1 months ago
Finite State Machine Synthesis for At-Speed Oscillation Testability
In this paper, we propose an oscillation-based test methodology for sequential testing. This approach provides many advantages over traditional methods. (1) It is at-speed testing...
Katherine Shu-Min Li, Chung-Len Lee, Tagin Jiang, ...
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
13 years 8 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber