Sciweavers

494 search results - page 30 / 99
» Optimal Carpet Cutting
Sort
View
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
MICCAI
2001
Springer
14 years 28 days ago
Segmentation of Dynamic N-D Data Sets via Graph Cuts Using Markov Models
Abstract. This paper describes a new segmentation technique for multidimensional dynamic data. One example of such data is a perfusion sequence where a number of 3D MRI volumes sho...
Yuri Boykov, Vivian S. Lee, Henry Rusinek, Ravi Ba...
SODA
2003
ACM
125views Algorithms» more  SODA 2003»
13 years 9 months ago
Random MAX SAT, random MAX CUT, and their phase transitions
With random inputs, certain decision problems undergo a “phase transition”. We prove similar behavior in an optimization context. Given a conjunctive normal form (CNF) formula...
Don Coppersmith, David Gamarnik, Mohammad Taghi Ha...
WADS
2009
Springer
256views Algorithms» more  WADS 2009»
14 years 3 months ago
Dynamic Graph Clustering Using Minimum-Cut Trees
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...
Robert Görke, Tanja Hartmann, Dorothea Wagner
SIGMETRICS
2002
ACM
171views Hardware» more  SIGMETRICS 2002»
13 years 8 months ago
Characterizing the d-TLB behavior of SPEC CPU2000 benchmarks
Despite the numerous optimization and evaluation studies that have been conducted with TLBs over the years, there is still a deficiency in an indepth understanding of TLB characte...
Gokul B. Kandiraju, Anand Sivasubramaniam