Sciweavers

486 search results - page 74 / 98
» Online update of b-trees
Sort
View
MOBISYS
2007
ACM
15 years 9 months ago
Surface street traffic estimation
In this paper, we propose a simple yet effective method of identifying traffic conditions on surface streets given location traces collected from on-road vehicles--this requires o...
Jungkeun Yoon, Brian Noble, Mingyan Liu
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
15 years 7 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu
WWW
2010
ACM
15 years 4 months ago
Scalable discovery of contradictions on the web
Our study addresses the problem of large-scale contradiction detection and management, from data extracted from the Web. We describe the first systematic solution to the problem,...
Mikalai Tsytsarau, Themis Palpanas, Kerstin Deneck...
WWW
2010
ACM
15 years 4 months ago
Identifying spam link generators for monitoring emerging web spam
In this paper, we address the question of how we can identify hosts that will generate links to web spam. Detecting such spam link generators is important because almost all new s...
Young-joo Chung, Masashi Toyoda, Masaru Kitsuregaw...
81
Voted
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
15 years 4 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak