7015 search results - page 67 / 1403 » Approximation algorithms for co-clustering |
139
click to vote
TIP
2008
15 years 3 months ago
2008
Abstract--In this paper, we present a complete and practical algorithm for the approximation of level-set-based curve evolution suitable for real-time implementation. In particular...
179
click to vote
CPM
1998
Springer
15 years 7 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
113
click to vote
IWPEC
2009
Springer
15 years 9 months ago
2009
Springer
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by ...
116
click to vote
CCCG
2007
15 years 4 months ago
2007
Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to find a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rec...
121
click to vote
ICANN
2007
Springer
15 years 9 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...