Sciweavers

1257 search results - page 120 / 252
» A generalization of Euler's constant
Sort
View
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 7 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
WWW
2007
ACM
14 years 10 months ago
Query-driven indexing for peer-to-peer text retrieval
We describe a query-driven indexing framework for scalable text retrieval over structured P2P networks. To cope with the bandwidth consumption problem that has been identified as ...
Gleb Skobeltsyn, Toan Luu, Karl Aberer, Martin Raj...
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
14 years 10 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 10 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
FPGA
2010
ACM
209views FPGA» more  FPGA 2010»
14 years 7 months ago
FPGA power reduction by guarded evaluation
Guarded evaluation is a power reduction technique that involves identifying sub-circuits (within a larger circuit) whose inputs can be held constant (guarded) at specific times d...
Chirag Ravishankar, Jason Helge Anderson