Sciweavers

3471 search results - page 593 / 695
» Obstacle Numbers of Graphs
Sort
View
CSE
2009
IEEE
15 years 11 months ago
Enabling Privacy as a Fundamental Construct for Social Networks
The current set of social networking platforms, e.g. Facebook and MySpace, has created a new class of Internet applications called social software. These systems focus on leveragi...
E. Michael Maximilien, Tyrone Grandison, Kun Liu, ...
ICC
2009
IEEE
148views Communications» more  ICC 2009»
15 years 11 months ago
Analysis of Probabilistic Flooding: How Do We Choose the Right Coin?
Abstract—This paper studies probabilistic information dissemination in random networks. Consider the following scenario: A node intends to deliver a message to all other nodes in...
Sérgio Crisóstomo, Udo Schilcher, Ch...
P2P
2009
IEEE
231views Communications» more  P2P 2009»
15 years 11 months ago
Measuring the Cost of Online Load-Balancing in Distributed Range-Queriable Systems
Distributed systems such as Peer-to-Peer overlays have been shown to efficiently support the processing of range queries over large numbers of participating hosts. In such system...
Ioannis Konstantinou, Dimitrios Tsoumakos, Nectari...
140
Voted
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
15 years 11 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
CIKM
2009
Springer
15 years 11 months ago
Graph-based seed selection for web-scale crawlers
One of the most important steps in web crawling is determining the starting points, or seed selection. This paper identifies and explores the problem of seed selection in webscal...
Shuyi Zheng, Pavel Dmitriev, C. Lee Giles