Sciweavers

9949 search results - page 228 / 1990
» On the Network Complexity of Selection
Sort
View
RECOMB
2005
Springer
16 years 7 months ago
Decomposition of Overlapping Protein Complexes: A Graph Theoretical Method for Analyzing Static and Dynamic Protein Associations
Background: Most cellular processes are carried out by multi-protein complexes, groups of proteins that bind together to perform a specific task. Some proteins form stable complex...
Elena Zotenko, Katia S. Guimarães, Raja Jot...
COMGEO
2010
ACM
15 years 6 months ago
The complexity of flow on fat terrains and its i/o-efficient computation
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
Mark de Berg, Otfried Cheong, Herman J. Haverkort,...
INFOCOM
2000
IEEE
15 years 11 months ago
An Empirical Evaluation of Client-Side Server Selection Algorithms
—Efficient server selection algorithms reduce retrieval time for objects replicated on different servers and are an important component of Internet cache architectures. This pap...
Sandra G. Dykes, Kay A. Robbins, Clinton L. Jeffer...
IJCNN
2006
IEEE
16 years 20 days ago
Leave-One-Out Cross-Validation Based Model Selection Criteria for Weighted LS-SVMs
Abstract— While the model parameters of many kernel learning methods are given by the solution of a convex optimisation problem, the selection of good values for the kernel and r...
Gavin C. Cawley
OPODIS
2007
15 years 8 months ago
Peer to Peer Multidimensional Overlays: Approximating Complex Structures
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
Olivier Beaumont, Anne-Marie Kermarrec, Etienne Ri...