Sciweavers

1199 search results - page 144 / 240
» Graph Theory
Sort
View
145
Voted
MOBIHOC
2005
ACM
16 years 3 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
WWW
2003
ACM
16 years 4 months ago
Mining newsgroups using networks arising from social behavior
Recent advances in information retrieval over hyperlinked corpora have convincinglydemonstratedthat links carry less noisy information than text. We investigate the feasibility of...
Rakesh Agrawal, Sridhar Rajagopalan, Ramakrishnan ...
EMSOFT
2011
Springer
14 years 3 months ago
Hard-real-time scheduling of data-dependent tasks in embedded streaming applications
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...
Mohamed Bamakhrama, Todor Stefanov
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
16 years 4 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
16 years 4 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni