1382 search results - page 101 / 277 » Formal Analysis of Online Algorithms |
184
click to vote
CCS
2009
ACM
16 years 6 months ago
2009
ACM
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
179
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
171
click to vote
COLT
2008
Springer
15 years 7 months ago
2008
Springer
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
182
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract—Packet delay traces are important measurements for analyzing end-to-end performance and for designing traffic control algorithms in computer networks. Due to the fact t...
167
click to vote
CIAC
2006
Springer
15 years 9 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...