Sciweavers

2503 search results - page 255 / 501
» A study of 3-arc graphs
Sort
View
SIGMOD
2010
ACM
281views Database» more  SIGMOD 2010»
15 years 11 months ago
Continuous sampling for online aggregation over multiple queries
In this paper, we propose an online aggregation system called COSMOS (Continuous Sampling for Multiple queries in an Online aggregation System), to process multiple aggregate quer...
Sai Wu, Beng Chin Ooi, Kian-Lee Tan
152
Voted
KR
2010
Springer
15 years 11 months ago
Walking the Decidability Line for Rules with Existential Variables
We consider positive rules in which the conclusion may contain existentially quantified variables, which makes reasoning tasks (such as Deduction) undecidable. These rules have t...
Jean-François Baget, Michel LeClere, Marie-...
NOSSDAV
2010
Springer
15 years 11 months ago
Second life: a social network of humans and bots
Second Life (SL) is a virtual world where people interact and socialize through virtual avatars. Avatars behave similarly to their human counterparts in real life and naturally de...
Matteo Varvello, Geoffrey M. Voelker
CDC
2009
IEEE
115views Control Systems» more  CDC 2009»
15 years 11 months ago
Quantized consensus via adaptive stochastic gossip algorithm
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...
Javad Lavaei, Richard M. Murray
COCOON
2001
Springer
15 years 10 months ago
Finding the Most Vital Node of a Shortest Path
In an undirected, 2-node connected graph G = (V, E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in ...
Enrico Nardelli, Guido Proietti, Peter Widmayer