Sciweavers

1074 search results - page 91 / 215
» An ASM-Characterization of a Class of Distributed Algorithms
Sort
View
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
14 years 11 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
CSDA
2006
85views more  CSDA 2006»
14 years 9 months ago
Two-way Poisson mixture models for simultaneous document classification and word clustering
An approach to simultaneous document classification and word clustering is developed using a two-way mixture model of Poisson distributions. Each document is represented by a vect...
Jia Li, Hongyuan Zha
CLUSTER
2009
IEEE
15 years 4 months ago
Oblivious routing schemes in extended generalized Fat Tree networks
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...
Germán Rodríguez, Cyriel Minkenberg,...
IJFCS
2006
82views more  IJFCS 2006»
14 years 9 months ago
Routing Multiple Width Communications on the Circuit Switched Tree
Dynamically reconfigurable architectures offer extremely fast solutions to various problems. The Circuit Switched Tree (CST) is an important interconnect used to implement such ar...
Krishnendu Roy, Ramachandran Vaidyanathan, Jerry L...
CDC
2008
IEEE
130views Control Systems» more  CDC 2008»
15 years 4 months ago
Stochastic multiscale approaches to consensus problems
Abstract— While peer-to-peer consensus algorithms have enviable robustness and locality for distributed estimation and computation problems, they have poor scaling behavior with ...
Jong-Han Kim, Matthew West, Sanjay Lall, Eelco Sch...