Sciweavers

845 search results - page 143 / 169
» Parallel Exact Inference
Sort
View
72
Voted
TIT
2002
101views more  TIT 2002»
14 years 9 months ago
Spectrally efficient noncoherent communication
This paper considers noncoherent communication over a frequency-nonselective channel in which the time-varying channel gain is unknown a priori, but is approximately constant over ...
Dilip Warrier, Upamanyu Madhow
PVLDB
2010
110views more  PVLDB 2010»
14 years 8 months ago
Read-Once Functions and Query Evaluation in Probabilistic Databases
Probabilistic databases hold promise of being a viable means for large-scale uncertainty management, increasingly needed in a number of real world applications domains. However, q...
Prithviraj Sen, Amol Deshpande, Lise Getoor
IMC
2010
ACM
14 years 7 months ago
Measurement of loss pairs in network paths
Loss-pair measurement was proposed a decade ago for discovering network path properties, such as a router's buffer size. A packet pair is regarded as a loss pair if exactly o...
Edmond W. W. Chan, Xiapu Luo, Weichao Li, Waiting ...
104
Voted
JSSPP
2007
Springer
15 years 3 months ago
QBETS: Queue Bounds Estimation from Time Series
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. Because these machines are...
Daniel Nurmi, John Brevik, Richard Wolski
FOCS
1998
IEEE
15 years 1 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello