Sciweavers

3708 search results - page 150 / 742
» Approximating Betweenness Centrality
Sort
View
96
Voted
ICCAD
1994
IEEE
67views Hardware» more  ICCAD 1994»
15 years 5 months ago
The reproducing placement problem with applications
We study a new placement problem: the reproducing placement problem (RPP). In each phase a module (or gate) is decomposed into two (or more) simpler modules. The goal is nd a \go...
Wei-Liang Lin, Majid Sarrafzadeh, Chak-Kuen Wong
83
Voted
ESA
2006
Springer
130views Algorithms» more  ESA 2006»
15 years 4 months ago
Reporting Flock Patterns
Data representing moving objects is rapidly getting more available, especially in the area of wildlife GPS tracking. It is a central belief that information is hidden in large data...
Marc Benkert, Joachim Gudmundsson, Florian Hü...
83
Voted
ATAL
2008
Springer
15 years 2 months ago
Reaction functions for task allocation to cooperative agents
In this paper, we present ARF, our initial effort at solving taskallocation problems where cooperative agents need to perform tasks simultaneously. An example is multi-agent routi...
Xiaoming Zheng, Sven Koenig
102
Voted
ICASSP
2010
IEEE
15 years 1 months ago
On expectation maximization based channel and noise estimation beyond the vector Taylor series expansion
In this work, we show how expectation maximization based simultaneous channel and noise estimation can be derived without a vector Taylor series expansion. The central idea is to ...
Friedrich Faubel, John W. McDonough, Dietrich Klak...
85
Voted
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 28 days ago
Distributed anonymous discrete function computation
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...
Julien M. Hendrickx, Alexander Olshevsky, John N. ...