2800 search results - page 346 / 560 » Scaling RDF with time |
196
click to vote
SIGSOFT
2007
ACM
16 years 7 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
147
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
We present three new reader-writer lock algorithms that scale under high read-only contention. Many previous reader-writer locks suffer significant degradation when many readers a...
174
Voted
KDD
2008
ACM
16 years 7 months ago
2008
ACM
We present a detailed study of network evolution by analyzing four large online social networks with full temporal information about node and edge arrivals. For the first time at ...
193
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingl...
187
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
This paper presents a novel Second Order Cone Programming (SOCP) formulation for large scale binary classification tasks. Assuming that the class conditional densities are mixture...