3894 search results - page 398 / 779 » Approximation Algorithms for Biclustering Problems |
149
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...
157
Voted
SSD
2005
Springer
15 years 10 months ago
2005
Springer
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...
134
Voted
COMPGEOM
2006
ACM
15 years 11 months ago
2006
ACM
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
121
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
In this article, new variation operators for evolutionary multiobjective algorithms (EMOA) are proposed. On the basis of a predator-prey model theoretical considerations as well a...
148
click to vote
PODS
2004
ACM
16 years 5 months ago
2004
ACM
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...