Sciweavers

106 search results - page 17 / 22
» An Improved Algorithm for Optimal Bin Packing
Sort
View
WWW
2008
ACM
14 years 8 months ago
Unsupervised query segmentation using generative language models and wikipedia
In this paper, we propose a novel unsupervised approach to query segmentation, an important task in Web search. We use a generative query model to recover a query's underlyin...
Bin Tan, Fuchun Peng
ICS
2009
Tsinghua U.
13 years 5 months ago
R-ADMAD: high reliability provision for large-scale de-duplication archival storage systems
Data de-duplication has become a commodity component in dataintensive systems and it is required that these systems provide high reliability comparable to others. Unfortunately, b...
Chuanyi Liu, Yu Gu, Linchun Sun, Bin Yan, Dongshen...
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
14 years 12 days ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
INFOCOM
2009
IEEE
14 years 2 months ago
MobTorrent: A Framework for Mobile Internet Access from Vehicles
Abstract—In this paper, we present MobTorrent, an ondemand, user-driven framework designed for vehicles which have intermittent high speed access to roadside WiFi access points (...
Bin Bin Chen, Mun Choon Chan
FOCS
2005
IEEE
14 years 1 months ago
Truthful and Near-Optimal Mechanism Design via Linear Programming
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
Ron Lavi, Chaitanya Swamy