Sciweavers

2681 search results - page 176 / 537
» Problem F
Sort
View
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
13 years 1 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu
NETWORKS
2010
13 years 9 months ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...
CVPR
2011
IEEE
13 years 7 months ago
Adequate Reconstruction of Transparent Objects on a Shoestring Budget
Reconstructing transparent objects is a challenging problem. While producing reasonable results for quite complex objects, existing approaches require custom calibration or somewh...
Sai-Kit Yeung, Tai-Pang Wu, Chi-keung Tang, Tony F...
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
14 years 11 months ago
Optimal approximations of the frequency moments of data streams
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
Piotr Indyk, David P. Woodruff
EOR
2007
69views more  EOR 2007»
13 years 10 months ago
Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts
— We describe a solution procedure for a special case of the periodic vehicle routing problem (PVRP). Operation managers at an auto parts in the north of Spain described the opti...
Jesús F. Alegre, Manuel Laguna, Joaqu&iacut...