7015 search results - page 242 / 1403 » Approximation algorithms for co-clustering |
166
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn1/k ) expected time, construc...
187
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
160
click to vote
ISMVL
2009
IEEE
16 years 1 months ago
2009
IEEE
Using concepts from rough set theory we investigate the existence of approximative descriptions of collections of objects that can be extracted from data sets, a problem of intere...
160
click to vote
DIS
2007
Springer
16 years 21 days ago
2007
Springer
The maximum cardinality of a frequent set as well as the minimum cardinality of an infrequent set are important characteristic numbers in frequent (item) set mining. Gunopulos et a...
172
click to vote
ICRA
2005
IEEE
16 years 4 days ago
2005
IEEE
— For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, T...