7015 search results - page 203 / 1403 » Approximation algorithms for co-clustering |
105
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
In this paper, we propose an algorithm to resample coarse vector fields in order to obtain vector fields of a higher density. Unlike the typical linear interpolation scheme, our a...
153
click to vote
GLOBECOM
2007
IEEE
16 years 24 days ago
2007
IEEE
— In this paper, we propose an analytical model to capture the dynamics of the RED algorithm. We first develop a system of recursive equations that describes the packet dropping...
147
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
How efficiently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple poly...
150
click to vote
CMMR
2003
Springer
15 years 11 months ago
2003
Springer
In the context of musical analysis, we propose an algorithm that automatically induces patterns from polyphonies. We define patterns as “perceptible repetitions in a musical piec...
199
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...