Sciweavers

9949 search results - page 97 / 1990
» On the Network Complexity of Selection
Sort
View
BIOINFORMATICS
2010
109views more  BIOINFORMATICS 2010»
13 years 9 months ago
Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters
Phylogenetic trees are widely used to display estimates of how groups of species evolved. Each phylogenetic tree can be seen as a collection of clusters, subgroups of the species ...
Leo van Iersel, Steven Kelk, Regula Rupp, Daniel H...
CN
1999
74views more  CN 1999»
13 years 8 months ago
On the network impact of dynamic server selection
Widespread replication of information can ameliorate the problem of server overloading but raises the allied question of server selection. Clients may be assigned to a replica in ...
Robert L. Carter, Mark Crovella
ICC
2007
IEEE
107views Communications» more  ICC 2007»
14 years 3 months ago
The SILO Architecture for Services Integration, controL, and Optimization for the Future Internet
— We propose a new internetworking architecture that represents a departure from current philosophy and practice, as a contribution to the ongoing debate regarding the future Int...
Rudra Dutta, George N. Rouskas, Ilia Baldine, Arno...
JMLR
2006
118views more  JMLR 2006»
13 years 8 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
AAAI
1998
13 years 10 months ago
Structured Representation of Complex Stochastic Systems
This paperconsidersthe problem of representingcomplex systems that evolve stochastically over time. Dynamic Bayesian networks provide a compact representation for stochastic proce...
Nir Friedman, Daphne Koller, Avi Pfeffer