Sciweavers

4526 search results - page 513 / 906
» Algorithmic problems related to the Internet
Sort
View
WEA
2005
Springer
107views Algorithms» more  WEA 2005»
16 years 10 days ago
Local Clustering of Large Graphs by Approximate Fiedler Vectors
Vectors [Extended Abstract] Pekka Orponen and Satu Elisa Schaeffer Laboratory for Theoretical Computer Science, P.O. Box 5400 FI-02015 TKK Helsinki University of Technology, Finlan...
Pekka Orponen, Satu Elisa Schaeffer
SIGECOM
2003
ACM
143views ECommerce» more  SIGECOM 2003»
16 years 3 days ago
Differential-revelation VCG mechanisms for combinatorial auctions
Combinatorial auctions, where bidders can submit bids on bundles of items, are economically efïŹcient mechanisms for selling items to bidders, and are attractive when the biddersâ...
Wolfram Conen, Tuomas Sandholm
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
15 years 11 months ago
Using performance fronts for parameter setting of stochastic metaheuristics
In this work, we explore the idea that parameter setting of stochastic metaheuristics should be considered as a multiobjective problem. The so-called “performance fronts” pres...
Johann Dréo
201
Voted
ICDE
1993
IEEE
158views Database» more  ICDE 1993»
15 years 11 months ago
Data fragmentation for parallel transitive closure strategies
A topic that is currently inspiring a lot of research is parallel (distributed) computation of transitive closure queries. In [lo] the disconnection set approach has been introduc...
Maurice A. W. Houtsma, Peter M. G. Apers, Gideon L...
192
Voted
NIPS
2008
15 years 8 months ago
Estimating Robust Query Models with Convex Optimization
Query expansion is a long-studied approach for improving retrieval effectiveness by enhancing the user's original query with additional related words. Current algorithms for ...
Kevyn Collins-Thompson