Sciweavers

2800 search results - page 557 / 560
» Scaling RDF with time
Sort
View
CORR
2011
Springer
198views Education» more  CORR 2011»
13 years 1 months ago
Decentralized Online Learning Algorithms for Opportunistic Spectrum Access
—The fundamental problem of multiple secondary users contending for opportunistic spectrum access over multiple channels in cognitive radio networks has been formulated recently ...
Yi Gai, Bhaskar Krishnamachari
ICDCN
2011
Springer
13 years 1 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
ICDE
2011
IEEE
224views Database» more  ICDE 2011»
13 years 1 months ago
SmartTrace: Finding similar trajectories in smartphone networks without disclosing the traces
—In this demonstration paper, we present a powerful distributed framework for finding similar trajectories in a smartphone network, without disclosing the traces of participatin...
Costandinos Costa, Christos Laoudias, Demetrios Ze...
SDM
2011
SIAM
232views Data Mining» more  SDM 2011»
13 years 13 days ago
A Sequential Dual Method for Structural SVMs
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...
Shirish Krishnaj Shevade, Balamurugan P., S. Sunda...
SDM
2011
SIAM
284views Data Mining» more  SDM 2011»
13 years 13 days ago
The Network Completion Problem: Inferring Missing Nodes and Edges in Networks
While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomp...
Myunghwan Kim 0002, Jure Leskovec