16430 search results - page 401 / 3286 » On Computable Tree Functions |
174
click to vote
HPCC
2005
Springer
16 years 10 days ago
2005
Springer
With the multicast technology, demands for the real-time group applications through multicasting is getting more important. An essential factor of these real-time strategy is to op...
189
click to vote
IFIP
2004
Springer
16 years 5 days ago
2004
Springer
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this proble...
160
click to vote
DASFAA
2004
IEEE
15 years 10 months ago
2004
IEEE
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
191
click to vote
HIPEAC
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. Designers of large parallel computers and clusters are becoming increasingly concerned with the cost and power consumption of the interconnection network. A simple way to...
197
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...