963 search results - page 116 / 193 » On Computation of Performance Bounds of Optimal Index Assign... |
116
click to vote
WIOPT
2011
IEEE
14 years 3 months ago
2011
IEEE
Abstract—This paper considers maximizing throughput utility in a multi-user network with partially observable Markov ON/OFF channels. Instantaneous channel states are never known...
102
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
TIT
2008
14 years 11 months ago
2008
Abstract--Max-product "belief propagation" (BP) is an iterative, message-passing algorithm for finding the maximum a posteriori (MAP) assignment of a discrete probability...
103
click to vote
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
108
click to vote
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...