Sciweavers

1647 search results - page 320 / 330
» Improved Randomized Approximation Algorithms for Lot-Sizing ...
Sort
View
CIKM
2010
Springer
13 years 6 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
CSL
2007
Springer
13 years 7 months ago
Soft indexing of speech content for search in spoken documents
The paper presents the Position Specific Posterior Lattice (PSPL), a novel lossy representation of automatic speech recognition lattices that naturally lends itself to efficient ...
Ciprian Chelba, Jorge Silva, Alex Acero
IROS
2009
IEEE
159views Robotics» more  IROS 2009»
14 years 2 months ago
Data gathering tours for mobile robots
— We study a path planning problem which arises when multiple robots are used to gather data from stationary devices with wireless communication capabilities. Each device has a g...
Deepak Bhadauria, Volkan Isler
TCSV
2002
69views more  TCSV 2002»
13 years 7 months ago
Optimizing channel allocation in a unified video-on-demand system
Unified video-on-demand (UVoD) is a recently proposed architecture that integrates multicast transmission with unicast transmission to improve system efficiency. Streaming channels...
Jack Y. B. Lee
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
14 years 7 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...