Sciweavers

16430 search results - page 283 / 3286
» On Computable Tree Functions
Sort
View
ISAAC
2005
Springer
89views Algorithms» more  ISAAC 2005»
15 years 10 months ago
Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics
We consider generalizations of the k-source sum of vertex eccentricity problem (k-SVET) and the k-source sum of source eccentricity problem (k-SSET) [1], which we call SDET and SSE...
Paraskevi Fragopoulou, Stavros D. Nikolopoulos, Le...
TYPES
2004
Springer
15 years 10 months ago
Exploring the Regular Tree Types
In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic deci...
Peter Morris, Thorsten Altenkirch, Conor McBride
AIIA
2007
Springer
15 years 8 months 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
MICS
2010
134views more  MICS 2010»
15 years 3 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
SI3D
2006
ACM
15 years 10 months ago
Approximate ambient occlusion for trees
Natural scenes contain large amounts of geometry, such as hundreds of thousands or even millions of tree leaves and grass blades. Subtle lighting effects present in such environme...
Kyle Hegeman, Simon Premoze, Michael Ashikhmin, Ge...