Sciweavers

8581 search results - page 1715 / 1717
» Digital Signal Processing
Sort
View
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 6 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
EUROSYS
2006
ACM
14 years 2 months ago
Experiences in building and operating ePOST, a reliable peer-to-peer application
Peer-to-peer (p2p) technology can potentially be used to build highly reliable applications without a single point of failure. However, most of the existing applications, such as ...
Alan Mislove, Ansley Post, Andreas Haeberlen, Pete...
CIKM
2007
Springer
13 years 11 months ago
Optimal proactive caching in peer-to-peer network: analysis and application
As a promising new technology with the unique properties like high efficiency, scalability and fault tolerance, Peer-toPeer (P2P) technology is used as the underlying network to b...
Weixiong Rao, Lei Chen 0002, Ada Wai-Chee Fu, Ying...
BMCBI
2007
168views more  BMCBI 2007»
13 years 5 months ago
Advancing translational research with the Semantic Web
Background: A fundamental goal of the U.S. National Institute of Health (NIH) "Roadmap" is to strengthen Translational Research, defined as the movement of discoveries i...
Alan Ruttenberg, Tim Clark, William Bug, Matthias ...
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 5 months ago
Universal Limit Laws for Depths in Random Trees
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
Luc Devroye
« Prev « First page 1715 / 1717 Last » Next »