Sciweavers

241 search results - page 4 / 49
» Fast heuristics for large scale covering-location problems
Sort
View
FAST
2009
13 years 8 months ago
Sparse Indexing: Large Scale, Inline Deduplication Using Sampling and Locality
We present sparse indexing, a technique that uses sampling and exploits the inherent locality within backup streams to solve for large-scale backup (e.g., hundreds of terabytes) t...
Mark Lillibridge, Kave Eshghi, Deepavali Bhagwat, ...
COR
2006
75views more  COR 2006»
13 years 11 months ago
A new heuristic recursive algorithm for the strip rectangular packing problem
A fast and new heuristic recursive algorithm to find a minimum height for two-dimensional strip rectangular packing problem is presented. This algorithm is mainly based on heurist...
Defu Zhang, Yan Kang, Ansheng Deng
KDD
2008
ACM
167views Data Mining» more  KDD 2008»
14 years 11 months ago
A sequential dual method for large scale multi-class linear svms
Efficient training of direct multi-class formulations of linear Support Vector Machines is very useful in applications such as text classification with a huge number examples as w...
S. Sathiya Keerthi, S. Sundararajan, Kai-Wei Chang...
ICCV
2009
IEEE
13 years 8 months ago
Efficient indexing for large scale visual search
With the popularity of "bag of visual terms" representations of images, many text indexing techniques have been applied in large-scale image retrieval systems. However, ...
Xiao Zhang, Zhiwei Li, Lei Zhang, Wei-Ying Ma, Heu...
ICC
2011
IEEE
236views Communications» more  ICC 2011»
12 years 10 months ago
0 to 10k in 20 Seconds: Bootstrapping Large-Scale DHT Networks
—A handful of proposals address the problem of bootstrapping a large DHT network from scratch, but they all forgo the standard DHT join protocols in favor of their own distribute...
Jae Woo Lee, Henning Schulzrinne, Wolfgang Kellere...