16430 search results - page 182 / 3286 » On Computable Tree Functions |
123
Voted
CVPR
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
147
click to vote
ACL2
2006
ACM
15 years 10 months ago
2006
ACM
Biologists studying the evolutionary relationships between organisms use software packages to solve the computational problems they encounter. Several of these problems involve th...
106
click to vote
GRID
2005
Springer
15 years 9 months ago
2005
Springer
Abstract— We propose a method for wide-area message passing systems to perform collective operations using dynamically created spanning trees. In our proposal, broadcasts and red...
150
click to vote
PERCOM
2005
ACM
16 years 3 months ago
2005
ACM
This paper presents a world model for location-aware and user-aware services in ubiquitous computing environments. It can be dynamically organized like a tree based on geographica...
141
click to vote
ALGORITHMICA
2006
15 years 3 months ago
2006
We show that the number of t-ary trees with path length equal to p is t h(t-1) tp log2 p(1+o(1)) , where h(x)=-x log2 x-(1-x) log2(1-x) is the binary entropy function. Besides its...