Sciweavers

7197 search results - page 1160 / 1440
» On the computational power of BlenX
Sort
View
IPL
2006
104views more  IPL 2006»
15 years 6 months ago
The communication complexity of the Hamming distance problem
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu
JNW
2008
164views more  JNW 2008»
15 years 6 months ago
Improving Multi-Agent Based Resource Coordination in Peer-to-Peer Networks
The distributed nature of peer-to-peer networks offers a solid ground for the deployment of environments where multiple agents, managing several resources, can cooperate in pursuin...
António Luis Lopes, Luís Miguel Bote...
ENTCS
2007
112views more  ENTCS 2007»
15 years 6 months ago
Structure and Properties of Traces for Functional Programs
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
Olaf Chitil, Yong Luo
ENTCS
2007
107views more  ENTCS 2007»
15 years 6 months ago
Applications = Components + GLoo
We are advocating a component-oriented software development approach that provides support for a clear separation between the computational and the compositional entities of an ap...
Markus Lumpe
NA
2008
297views more  NA 2008»
15 years 6 months ago
Generalized fast marching method: applications to image segmentation
In this paper, we propose a segmentation method based on the Generalized Fast Marching Method (GFMM) developed by Carlini et al.([6]). The classical Fast Marching Method (FMM) is a...
Nicolas Forcadel, Carole Le Guyader, Christian Gou...
« Prev « First page 1160 / 1440 Last » Next »