Sciweavers

2269 search results - page 361 / 454
» Query Incentive Networks
Sort
View
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
15 years 6 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
127
Voted
AMAI
1999
Springer
15 years 2 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen
CORR
2011
Springer
199views Education» more  CORR 2011»
14 years 6 months ago
Maximum Gain Round Trips with Cost Constraints
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
Franz Graf, Hans-Peter Kriegel, Matthias Schubert
KDD
2007
ACM
149views Data Mining» more  KDD 2007»
16 years 2 months ago
Distributed classification in peer-to-peer networks
This work studies the problem of distributed classification in peer-to-peer (P2P) networks. While there has been a significant amount of work in distributed classification, most o...
Ping Luo, Hui Xiong, Kevin Lü, Zhongzhi Shi
115
Voted
EDBT
2008
ACM
129views Database» more  EDBT 2008»
16 years 2 months ago
Continuous multi-way joins over distributed hash tables
This paper studies the problem of evaluating continuous multi-way joins on top of Distributed Hash Tables (DHTs). We present a novel algorithm, called recursive join (RJoin), that...
Stratos Idreos, Erietta Liarou, Manolis Koubarakis