3894 search results - page 454 / 779 » Approximation Algorithms for Biclustering Problems |
145
click to vote
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
153
click to vote
MOBIHOC
2006
ACM
16 years 4 months ago
2006
ACM
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
150
click to vote
CPM
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
130
click to vote
ICCV
2003
IEEE
16 years 6 months ago
2003
IEEE
This article proposes a solution of the Lambertian shape from shading (SFS) problem in the case of a pinhole camera model (performing a perspective projection). Our approach is ba...
159
click to vote
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
Data stream analysis frequently relies on identifying correlations and posing conditional queries on the data after it has been seen. Correlated aggregates form an important examp...