Sciweavers

16430 search results - page 503 / 3286
» On Computable Tree Functions
Sort
View
COMPUTING
2006
112views more  COMPUTING 2006»
15 years 7 months ago
Fast Summation of Radial Functions on the Sphere
Radial functions are a powerful tool in many areas of multidimensional approximation, especially when dealing with scattered data. We present a fast approximate algorithm for the ...
Jens Keiner, Stefan Kunis, Daniel Potts
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
16 years 15 days ago
Fast Algorithms for Computing the Tripartition-Based Distance Between Phylogenetic Networks
Consider two phylogenetic networks N and N′ of size n. The tripartition-based distance finds the proportion of tripartitions which are not shared by N and N′ . This distance i...
Nguyen Bao Nguyen, C. Thach Nguyen, Wing-Kin Sung
CIA
2006
Springer
15 years 10 months ago
Egalitarian Allocations of Indivisible Resources: Theory and Computation
We present a mechanism for collaboration and coordination amongst agents in multi-agent societies seeking social equity. This mechanism allows to compute egalitarian allocations of...
Paul-Amaury Matt, Francesca Toni
PLDI
1995
ACM
15 years 10 months ago
APT: A Data Structure for Optimal Control Dependence Computation
The control dependence relation is used extensively in restructuring compilers. This relation is usually represented using the control dependence graph; unfortunately, the size of...
Keshav Pingali, Gianfranco Bilardi
COMPSAC
2005
IEEE
15 years 9 months ago
A Low-Latency Checkpointing Scheme for Mobile Computing Systems
Fault-tolerant mobile computing systems have different requirements and restrictions, not taken into account by conventional distributed systems. This paper presents a coordinate...
Guohui Li, LihChyun Shu