Sciweavers

777 search results - page 28 / 156
» A fast algorithm for the computation of an upper bound on th...
Sort
View
ICDIM
2008
IEEE
14 years 2 months ago
A fast approximate algorithm for large-scale Latent Semantic Indexing
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....
Dell Zhang, Zheng Zhu
MMS
1998
13 years 7 months ago
Packet Audio Playout Delay Adjustment: Performance Bounds and Algorithms
In packet audio applications, packets are buffered at a receiving site and their playout delayed in order to compensate for variable network delays. In this paper, we consider the ...
Sue B. Moon, James F. Kurose, Donald F. Towsley
JAIR
2010
119views more  JAIR 2010»
13 years 6 months ago
Active Tuples-based Scheme for Bounding Posterior Beliefs
The paper presents a scheme for computing lower and upper bounds on the posterior marginals in Bayesian networks with discrete variables. Its power lies in its ability to use any ...
Bozhena Bidyuk, Rina Dechter, Emma Rollon
ISBI
2004
IEEE
14 years 8 months ago
A Fast Fully 4D Incremental Gradient Reconstruction Algorithm for List Mode PET Data
We present a fully four-dimensional, globally convergent, incremental gradient algorithm to estimate the continuous-time tracer density from list mode positron emission tomography...
Quanzheng Li, Evren Asma, Richard M. Leahy
CGO
2006
IEEE
14 years 1 months ago
Fast and Effective Orchestration of Compiler Optimizations for Automatic Performance Tuning
Although compile-time optimizations generally improve program performance, degradations caused by individual techniques are to be expected. One promising research direction to ove...
Zhelong Pan, Rudolf Eigenmann