Sciweavers

37 search results - page 7 / 8
» On the searchability of small-world networks with arbitrary ...
Sort
View
MST
2006
136views more  MST 2006»
13 years 5 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
DEXA
2009
Springer
166views Database» more  DEXA 2009»
14 years 3 days ago
Tags4Tags: Using Tagging to Consolidate Tags
Tagging has become increasingly popular and useful across various social networks and applications. It allows users to classify and organize resources for improving the retrieval p...
Leyla Jael García-Castro, Martin Hepp, Alex...
DATAMINE
2006
224views more  DATAMINE 2006»
13 years 5 months ago
Characteristic-Based Clustering for Time Series Data
With the growing importance of time series clustering research, particularly for similarity searches amongst long time series such as those arising in medicine or finance, it is cr...
Xiaozhe Wang, Kate A. Smith, Rob J. Hyndman
KR
2000
Springer
13 years 9 months ago
Reasoning with Axioms: Theory and Practice
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
Ian Horrocks, Stephan Tobies
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
13 years 10 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie