Sciweavers

7 search results - page 1 / 2
» alenex 2008
Sort
View
ALENEX
2008
131views Algorithms» more  ALENEX 2008»
13 years 6 months ago
Better Approximation of Betweenness Centrality
Robert Geisberger, Peter Sanders, Dominik Schultes
ALENEX
2008
89views Algorithms» more  ALENEX 2008»
13 years 6 months ago
Obtaining Optimal k-Cardinality Trees Fast
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra...
ALENEX
2008
91views Algorithms» more  ALENEX 2008»
13 years 5 months ago
How much Geometry it takes to Reconstruct a 2-Manifold in R3
Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola...
ALENEX
2008
192views Algorithms» more  ALENEX 2008»
13 years 5 months ago
Compressed Inverted Indexes for In-Memory Search Engines
We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system ...
Frederik Transier, Peter Sanders
ALENEX
2008
133views Algorithms» more  ALENEX 2008»
13 years 6 months ago
Comparing Online Learning Algorithms to Stochastic Approaches for the Multi-Period Newsvendor Problem
The multi-period newsvendor problem describes the dilemma of a newspaper salesman--how many paper should he purchase each day to resell, when he doesn't know the demand? We d...
Shawn O'Neil, Amitabh Chaudhary