Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
AAIM
2009
Springer
107views Algorithms» more  AAIM 2009»
11 years 11 months ago
Optimal Auctions Capturing Constraints in Sponsored Search
Most sponsored search auctions use the Generalized Second Price (GSP) rule. Given the GSP rule, they try to give an optimal allocation, an easy task when the only need is to alloca...
Esteban Feuerstein, Pablo Ariel Heiber, Matí...
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
11 years 11 months ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...
AAIM
2009
Springer
172views Algorithms» more  AAIM 2009»
12 years 6 months ago
PLDA: Parallel Latent Dirichlet Allocation for Large-Scale Applications
Abstract. This paper presents PLDA, our parallel implementation of Latent Dirichlet Allocation on MPI and MapReduce. PLDA smooths out storage and computation bottlenecks and provid...
Yi Wang, Hongjie Bai, Matt Stanton, Wen-Yen Chen, ...
AAIM
2009
Springer
105views Algorithms» more  AAIM 2009»
12 years 8 months ago
On Acyclicity of Games with Cycles
We study restricted improvement cycles (ri-cycles) in finite positional n-person games with perfect information modeled by directed graphs (digraphs) that may contain cycles. We o...
Daniel Andersson, Vladimir Gurvich, Thomas Dueholm...
AAIM
2009
Springer
98views Algorithms» more  AAIM 2009»
12 years 8 months ago
Latency Constrained Aggregation in Chain Networks Admits a PTAS
This paper studies the aggregation of messages in networks that consist of a chain of nodes, and each message is time-constrained such that it needs to be aggregated during a give...
Tim Nonner, Alexander Souza
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
12 years 8 months ago
Orca Reduction and ContrAction Graph Clustering
During the last years, a wide range of huge networks has been made available to researchers. The discovery of natural groups, a task called graph clustering, in such datasets is a ...
Daniel Delling, Robert Görke, Christian Schul...
AAIM
2009
Springer
119views Algorithms» more  AAIM 2009»
12 years 8 months ago
Link Distance and Shortest Path Problems in the Plane
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fr´echet distance in the plane with polygonal obstacles. Distances between points are measured eithe...
Atlas F. Cook, Carola Wenk
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
12 years 8 months ago
Integer Polyhedra for Program Analysis
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from im...
Philip J. Charles, Jacob M. Howe, Andy King
AAIM
2009
Springer
118views Algorithms» more  AAIM 2009»
12 years 8 months ago
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
Jiong Guo, Christian Komusiewicz, Rolf Niedermeier...
AAIM
2009
Springer
123views Algorithms» more  AAIM 2009»
12 years 8 months ago
Efficiently Generating k-Best Solutions to Procurement Auctions
: © Efficiently Generating k-Best Solutions to Procurement Auctions Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Tarjan HP Laboratories HPL-2009-163 procurement, auctions, dec...
Andrew Byde, Terence Kelly, Yunhong Zhou, Robert E...
books