4526 search results - page 686 / 906 » Algorithmic problems related to the Internet |
143
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
121
click to vote
DCC
2004
IEEE
16 years 4 months ago
2004
IEEE
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
137
click to vote
LCTRTS
2007
Springer
15 years 10 months ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
139
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
128
click to vote
COR
2008
15 years 4 months ago
2008
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...