Sciweavers

2880 search results - page 416 / 576
» Types are calling conventions
Sort
View
WDAG
2005
Springer
67views Algorithms» more  WDAG 2005»
15 years 12 months ago
What Can Be Implemented Anonymously?
Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? W...
Rachid Guerraoui, Eric Ruppert
BVAI
2005
Springer
15 years 12 months ago
Incomplete Contour Representations and Shape Descriptors: ICR Test Studies
Inspired by psychophysical studies of the human cognitive abilities we propose a novel aspect and a method for performance evaluation of contour based shape recognition algorithms ...
Anarta Ghosh, Nicolai Petkov
DOLAP
2004
ACM
15 years 12 months ago
Beyond data warehousing: what's next in business intelligence?
During the last ten years the approach to business management has deeply changed, and companies have understood the importance of enforcing achievement of the goals defined by the...
Matteo Golfarelli, Stefano Rizzi, Iuris Cella
PLDI
2004
ACM
15 years 12 months ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken
ARCS
2004
Springer
15 years 12 months ago
Heterogenous Data Fusion via a Probabilistic Latent-Variable Model
In a pervasive computing environment, one is facing the problem of handling heterogeneous data from different sources, transmitted over heterogeneous channels and presented on het...
Kai Yu, Volker Tresp