Sciweavers

2362 search results - page 208 / 473
» A new approach to edge detection
Sort
View
ICDM
2008
IEEE
122views Data Mining» more  ICDM 2008»
15 years 8 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
127
Voted
CP
2003
Springer
15 years 7 months ago
Using Constraint Programming to Solve the Maximum Clique Problem
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
Jean-Charles Régin
FSTTCS
2000
Springer
15 years 5 months ago
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...
Michael R. Fellows, Catherine McCartin, Frances A....
ACL
2003
15 years 3 months ago
A Tabulation-Based Parsing Method that Reduces Copying
This paper presents a new bottom-up chart parsing algorithm for Prolog along with a compilation procedure that reduces the amount of copying at run-time to a constant number (2) p...
Gerald Penn, Cosmin Munteanu
ONDM
2000
15 years 3 months ago
Distributed Router Architecture for Packet-Routed Optical Networks
: A new proposal for an optical packet-routed network based on a distributed router architecture in a WDM network is described. Buffering, scheduling and wavelength assignment func...
Michael Düser, Eugene Kozlovski, Robert I. Ki...