Sciweavers

1385 search results - page 250 / 277
» Clustering by Random Projections
Sort
View
133
Voted
PODC
2005
ACM
15 years 9 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
SIGIR
2005
ACM
15 years 9 months ago
Basic issues on the processing of web queries
Search engines represent a key component of Web economy these days. Despite that, there is not much technical literature available on their design, fine tuning, and internal oper...
Claudine Santos Badue, Ramurti A. Barbosa, Paulo B...
130
Voted
FOSSACS
2005
Springer
15 years 9 months ago
Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications
We study the concept of choice for true concurrency models such as prime event structures and safe Petri nets. We propose a dynamic variation of the notion of cluster previously in...
Samy Abbes, Albert Benveniste
148
Voted
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
15 years 9 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
ICCS
2004
Springer
15 years 9 months ago
Complex Network of Earthquakes
Complex Network of Earthquakes Sumiyoshi Abe Institute of Physics, University of Tsukuba Ibaraki 3058571, Japan First, a brief discussion is made about a relevance of nonextensive...
Sumiyoshi Abe, Norikazu Suzuki