Sciweavers

255 search results - page 29 / 51
» Spanning Trees and Function Classes
Sort
View
SPAA
1996
ACM
14 years 18 days ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
AIIA
2007
Springer
14 years 14 days ago
Advanced Tree-Based Kernels for Protein Classification
One of the aims of modern Bioinformatics is to discover the molecular mechanisms that rule the protein operation. This would allow us to understand the complex processes involved i...
Elisa Cilia, Alessandro Moschitti
ICIP
2002
IEEE
14 years 10 months ago
Unsupervised image segmentation via Markov trees and complex wavelets
The goal in image segmentation is to label pixels in an image based on the properties of each pixel and its surrounding region. Recently Content-Based Image Retrieval (CBIR) has e...
Cián W. Shaffrey, Ian Jermyn, Nick G. Kings...
ITP
2010
179views Mathematics» more  ITP 2010»
14 years 10 days ago
The Isabelle Collections Framework
The Isabelle Collections Framework (ICF) provides a unified framework for using verified collection data structures in Isabelle/HOL formalizations and generating efficient functi...
Peter Lammich, Andreas Lochbihler
INFOCOM
2002
IEEE
14 years 1 months ago
Stability of a Multicast Tree
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...
Piet Van Mieghem, Milena Janic