5115 search results - page 772 / 1023 » On Randomized Lanczos Algorithms |
160
click to vote
QEST
2005
IEEE
16 years 21 hour ago
2005
IEEE
A framework to assess transient performance measures is introduced by generalizing the theory of the quasi Birthand-Death (QBD) paradigm to QBDs with marked time epochs (QBDm ). T...
155
click to vote
SRDS
2005
IEEE
16 years 19 hour ago
2005
IEEE
We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...
179
click to vote
SPAA
2005
ACM
16 years 5 hour ago
2005
ACM
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
124
click to vote
CIKM
2005
Springer
15 years 12 months ago
2005
Springer
Record deduplication is the task of merging database records that refer to the same underlying entity. In relational databases, accurate deduplication for records of one type is o...
192
click to vote
DAGM
2005
Springer
15 years 12 months ago
2005
Springer
A histogram-based method for the interpretation of three-dimensional (3D) point clouds is introduced, where point clouds represent the surface of a scene of multiple objects and ba...