Sciweavers

169 search results - page 23 / 34
» The Tree of Hubs Location Problem
Sort
View
134
Voted
APPROX
2005
Springer
136views Algorithms» more  APPROX 2005»
15 years 7 months ago
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
CN
2002
82views more  CN 2002»
15 years 1 months ago
Optimal allocation of electronic content
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
Israel Cidon, Shay Kutten, Ran Soffer
125
Voted
CVPR
2006
IEEE
16 years 3 months ago
Supervised Learning of Edges and Object Boundaries
Edge detection is one of the most studied problems in computer vision, yet it remains a very challenging task. It is difficult since often the decision for an edge cannot be made ...
Piotr Dollár, Zhuowen Tu, Serge Belongie
KDD
2006
ACM
120views Data Mining» more  KDD 2006»
16 years 2 months ago
Hierarchical topic segmentation of websites
In this paper, we consider the problem of identifying and segmenting topically cohesive regions in the URL tree of a large website. Each page of the website is assumed to have a t...
Ravi Kumar, Kunal Punera, Andrew Tomkins
DCOSS
2010
Springer
15 years 5 months ago
Data Spider: A Resilient Mobile Basestation Protocol for Efficient Data Collection in Wireless Sensor Networks
Traditional deployments of wireless sensor networks (WSNs) rely on static basestations to collect data. For applications with highly spatio-temporal and dynamic data generation, su...
Onur Soysal, Murat Demirbas