Sciweavers

178 search results - page 31 / 36
» Maximum likelihood of phylogenetic networks
Sort
View
VLSISP
1998
111views more  VLSISP 1998»
14 years 11 months ago
Quantitative Analysis of MR Brain Image Sequences by Adaptive Self-Organizing Finite Mixtures
This paper presents an adaptive structure self-organizing finite mixture network for quantification of magnetic resonance (MR) brain image sequences. We present justification fo...
Yue Wang, Tülay Adali, Chi-Ming Lau, Sun-Yuan...
TON
2010
80views more  TON 2010»
14 years 10 months ago
Replication routing in DTNs: a resource allocation approach
—Routing protocols for disruption-tolerant networks (DTNs) use a variety of mechanisms, including discovering the meeting probabilities among nodes, packet replication, and netwo...
Aruna Balasubramanian, Brian Neil Levine, Arun Ven...
CORR
2006
Springer
119views Education» more  CORR 2006»
14 years 11 months ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...
NN
1998
Springer
177views Neural Networks» more  NN 1998»
14 years 11 months ago
Soft vector quantization and the EM algorithm
The relation between hard c-means (HCM), fuzzy c-means (FCM), fuzzy learning vector quantization (FLVQ), soft competition scheme (SCS) of Yair et al. (1992) and probabilistic Gaus...
Ethem Alpaydin
CN
2007
141views more  CN 2007»
14 years 11 months ago
Identifying lossy links in wired/wireless networks by exploiting sparse characteristics
In this paper, we consider the problem of estimating link loss rates based on end-to-end path loss rates in order to identify lossy links on the network. We first derive a maximu...
Hyuk Lim, Jennifer C. Hou