Sciweavers

2168 search results - page 326 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
MOBICOM
2012
ACM
13 years 5 months ago
Faster GPS via the sparse fourier transform
GPS is one of the most widely used wireless systems. A GPS receiver has to lock on the satellite signals to calculate its position. The process of locking on the satellites is qui...
Haitham Hassanieh, Fadel Adib, Dina Katabi, Piotr ...
ICALP
2001
Springer
15 years 7 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
BMCBI
2010
155views more  BMCBI 2010»
15 years 3 months ago
A flexible R package for nonnegative matrix factorization
Background: Nonnegative Matrix Factorization (NMF) is an unsupervised learning technique that has been applied successfully in several fields, including signal processing, face re...
Renaud Gaujoux, Cathal Seoighe
PODS
2008
ACM
204views Database» more  PODS 2008»
16 years 3 months ago
Annotated XML: queries and provenance
We present a formal framework for capturing the provenance of data appearing in XQuery views of XML. Building on previous work on relations and their (positive) query languages, w...
J. Nathan Foster, Todd J. Green, Val Tannen
139
Voted
INFOCOM
2008
IEEE
15 years 9 months ago
Maximizing Resilient Throughput in Peer-to-Peer Network: A Generalized Flow Approach
—A unique challenge in P2P network is that the peer dynamics (departure or failure) cause unavoidable disruption to the downstream peers. While many works have been dedicated to ...
Bin Chang, Yi Cui, Yuan Xue