10988 search results - page 1669 / 2198 » Algorithmic Folding Complexity |
213
click to vote
PLDI
2003
ACM
16 years 21 days ago
2003
ACM
As more complex DSP algorithms are realized in practice, an increasing need for high-level stream abstractions that can be compiled without sacrificing efficiency. Toward this en...
266
click to vote
COMPGEOM
2010
ACM
16 years 16 days ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
251
click to vote
SIGECOM
2010
ACM
16 years 8 days ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
217
Voted
EMO
2009
Springer
16 years 2 days ago
2009
Springer
Abstract. Most existing evolutionary approaches to multiobjective optimization aim at finding an appropriate set of compromise solutions, ideally a subset of the Pareto-optimal se...
201
click to vote
KDD
2009
ACM
16 years 23 hour ago
2009
ACM
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...