Sciweavers

667 search results - page 54 / 134
» Exceptions for Algorithmic Skeletons
Sort
View
APPROX
2007
Springer
99views Algorithms» more  APPROX 2007»
14 years 3 months ago
Eigenvectors of Random Graphs: Nodal Domains
We initiate a systematic study of eigenvectors of random graphs. Whereas much is known about eigenvalues of graphs and how they reflect properties of the underlying graph, relati...
Yael Dekel, James R. Lee, Nathan Linial
GIS
2007
ACM
14 years 3 months ago
Predicting future locations using clusters' centroids
As technology advances we encounter more available data on moving objects, thus increasing our ability to mine spatiotemporal data. We can use this data for learning moving object...
Sigal Elnekave, Mark Last, Oded Maimon
ACNS
2006
Springer
148views Cryptology» more  ACNS 2006»
14 years 17 days ago
An Efficient Single-Key Pirates Tracing Scheme Using Cover-Free Families
A cover-free family is a well-studied combinatorial structure that has many applications in computer science and cryptography. In this paper, we propose a new public key traitor t...
Dongvu Tonien, Reihaneh Safavi-Naini
COLT
2008
Springer
13 years 10 months ago
Regret Bounds for Sleeping Experts and Bandits
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...
Robert D. Kleinberg, Alexandru Niculescu-Mizil, Yo...
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 9 months ago
Online Identification and Tracking of Subspaces from Highly Incomplete Information
This work presents GROUSE (Grassmanian Rank-One Update Subspace Estimation), an efficient online algorithm for tracking subspaces from highly incomplete observations. GROUSE requi...
Laura Balzano, Robert Nowak, Benjamin Recht