Sciweavers

1091 search results - page 40 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
DCOSS
2009
Springer
14 years 2 months ago
Cheap or Flexible Sensor Coverage
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...
SIGIR
2009
ACM
14 years 2 months ago
Approximating true relevance distribution from a mixture model based on irrelevance data
Pseudo relevance feedback (PRF), which has been widely applied in IR, aims to derive a distribution from the top n pseudo relevant documents D. However, these documents are often ...
Peng Zhang, Yuexian Hou, Dawei Song
CIKM
2004
Springer
14 years 1 months ago
Framework and algorithms for trend analysis in massive temporal data sets
Mining massive temporal data streams for significant trends, emerging buzz, and unusually high or low activity is an important problem with several commercial applications. In th...
Sreenivas Gollapudi, D. Sivakumar
CSDA
2010
132views more  CSDA 2010»
13 years 7 months ago
Approximate low-rank factorization with structured factors
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in micro...
Ivan Markovsky, Mahesan Niranjan
MMS
2000
13 years 7 months ago
Failure Recovery Algorithms for Multimedia Servers
In this paper, we present two novel disk failure recovery methods that utilize the inherent characteristics of video streams for efficient recovery. Whereas the first method explo...
Prashant J. Shenoy, Harrick M. Vin