683 search results - page 94 / 137 » Graph Annotations in Modeling Complex Network Topologies |
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
The use of statically compiled search networks for ASR systems using huge vocabularies and complex language models often becomes challenging in terms of memory requirements. Dynam...
105
click to vote
SPAA
2009
ACM
15 years 4 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
We propose a cooperative-coevolution – Parisian trend – algorithm, IMPEA (Independence Model based Parisian EA), to the problem of Bayesian networks structure estimation. It i...
ISMAR
2006
IEEE
15 years 3 months ago
2006
IEEE
With tracking setups becoming increasingly complex, it gets more difficult to find suitable algorithms for tracking, calibration and sensor fusion. A large number of solutions e...
94
Voted
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—A unique challenge in P2P network is that the peer dynamics (departure or failure) cause unavoidable disruption to the downstream peers. While many works have been dedicated to ...