620 search results - page 18 / 124 » A Simple and Fast Min-cut Algorithm |
114
click to vote
ICDCS
2000
IEEE
15 years 6 months ago
2000
IEEE
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
122
click to vote
DISOPT
2007
15 years 1 months ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
126
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
125
click to vote
ESANN
2004
15 years 3 months ago
2004
Self-Organizing Maps (SOM) are very powerful tools for data mining, in particular for visualizing the distribution of the data in very highdimensional data sets. Moreover, the 2D m...
135
click to vote
VLSID
2000
IEEE
15 years 6 months ago
2000
IEEE
Digital images are convenient media for describing and storing spatial, temporal, spectral, and physical components of information contained in a variety of domains(e.g. aerial/sa...