2252 search results - page 187 / 451 » Lower Bounds for Dynamic Algorithms |
137
Voted
KDD
2009
ACM
16 years 4 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
132
Voted
SIGECOM
2006
ACM
15 years 9 months ago
2006
ACM
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
143
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We investigate the extent to which price updates can increase the revenue of a seller with little prior information on demand. We study prior-free revenue maximization for a selle...
111
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
118
Voted
WEA
2007
Springer
15 years 9 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...