1632 search results - page 173 / 327 » Sublinear Time Algorithms for Metric Space Problems |
134
click to vote
JMLR
2006
15 years 4 months ago
2006
Given a matrix of values in which the rows correspond to objects and the columns correspond to features of the objects, rearrangement clustering is the problem of rearranging the ...
143
click to vote
SAINT
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we present an online algorithm that attacks the problem of placing relay nodes in regions where high localized congestion is detected. Congestion refers to the netwo...
159
click to vote
KES
1999
Springer
15 years 8 months ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
135
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
123
click to vote
ICCAD
2004
IEEE
16 years 1 months ago
2004
IEEE
In this paper we study the technology mapping problem for FPGA architectures to minimize chip area, or the total number of lookup tables (LUTs) of the mapped design, under the chi...