Sciweavers

39 search results - page 5 / 8
» Online Knapsack Revisited
Sort
View
SODA
2001
ACM
102views Algorithms» more  SODA 2001»
13 years 8 months ago
Approximate majorization and fair online load balancing
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
Ashish Goel, Adam Meyerson, Serge A. Plotkin
PODC
2010
ACM
13 years 9 months ago
Brief announcement: revisiting the power-law degree distribution for social graph analysis
The study of complex networks led to the belief that the connectivity of network nodes generally follows a Power-law distribution. In this work, we show that modeling large-scale ...
Alessandra Sala, Haitao Zheng, Ben Y. Zhao, Sabrin...
BMVC
2000
13 years 8 months ago
The Cross Ratio: A Revisit to its Probability Density Function
The cross ratio has wide applications in computer vision because of its invariance under projective transformation. In active vision where the projections of quadruples of colline...
D. Q. Huynh
ALGORITHMICA
2010
155views more  ALGORITHMICA 2010»
13 years 7 months ago
Bin Packing with Rejection Revisited
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
Leah Epstein
DEXA
2011
Springer
263views Database» more  DEXA 2011»
12 years 7 months ago
Sampling the National Deep Web
A huge portion of today’s Web consists of web pages filled with information from myriads of online databases. This part of the Web, known as the deep Web, is to date relatively ...
Denis Shestakov