Sciweavers

1823 search results - page 68 / 365
» Distributed lossy averaging
Sort
View
ICML
2007
IEEE
16 years 4 months ago
Infinite mixtures of trees
Finite mixtures of tree-structured distributions have been shown to be efficient and effective in modeling multivariate distributions. Using Dirichlet processes, we extend this ap...
Sergey Kirshner, Padhraic Smyth
PPSN
1998
Springer
15 years 8 months ago
Ant Colonies for Adaptive Routing in Packet-Switched Communications Networks
In this paper we present AntNet, a novel adaptive approach to routing tables learning in packet-switched communications networks. AntNet is inspired by the stigmergy model of commu...
Gianni Di Caro, Marco Dorigo
ESA
2006
Springer
139views Algorithms» more  ESA 2006»
15 years 7 months ago
Stochastic Shortest Paths Via Quasi-convex Maximization
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
Evdokia Nikolova, Jonathan A. Kelner, Matthew Bran...
AINA
2009
IEEE
15 years 11 months ago
TopDNS: Experiences Building Internet-Based Topologies with GNP
Building realistic Internet topologies is an important step towards predicting the behavior of new distributed applications and protocols. We are creating topologies that predict ...
Gert Pfeifer, Christof Fetzer
RSFDGRC
2005
Springer
111views Data Mining» more  RSFDGRC 2005»
15 years 9 months ago
Feature Selection with Adjustable Criteria
Abstract. We present a study on a rough set based approach for feature selection. Instead of using significance or support, Parameterized Average Support Heuristic (PASH) consider...
Jingtao Yao, Ming Zhang