Sciweavers

2310 search results - page 378 / 462
» Coloring Random Graphs
Sort
View
SIGIR
2009
ACM
14 years 2 months ago
On social networks and collaborative recommendation
Social network systems, like last.fm, play a significant role in Web 2.0, containing large amounts of multimedia-enriched data that are enhanced both by explicit user-provided an...
Ioannis Konstas, Vassilios Stathopoulos, Joemon M....
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 2 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
TAMC
2010
Springer
14 years 28 days ago
Streaming Algorithms for Some Problems in Log-Space
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
Ajesh Babu, Nutan Limaye, Girish Varma
DCOSS
2006
Springer
13 years 11 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
13 years 9 months ago
Unconditionally reliable message transmission in directed networks
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
Bhavani Shankar, Prasant Gopal, Kannan Srinathan, ...