Sciweavers

7200 search results - page 313 / 1440
» On the Computational Power of Winner-Take-All
Sort
View
GBRPR
2007
Springer
16 years 27 days ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke
165
Voted
PKC
2007
Springer
125views Cryptology» more  PKC 2007»
16 years 25 days ago
Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
Damg˚ard et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposit...
Takashi Nishide, Kazuo Ohta
ESCIENCE
2005
IEEE
16 years 10 days ago
Transparent Resource Allocation to Exploit Idle Cluster Nodes in Computational Grids
Clusters of workstations are one of the most suitable resources to assist e-scientists in the execution of largescale experiments that demand processing power. The utilization rat...
Marco Aurélio Stelmar Netto, Rodrigo N. Cal...
HPCS
2005
IEEE
16 years 10 days ago
Comparison of Advanced Authorisation Infrastructures for Grid Computing
The widespread use of Grid technology and distributed compute power, with all its inherent benefits, will only be established if the use of that technology can be guaranteed effic...
A. J. Stell, Richard O. Sinnott, J. P. Watt
ISADS
2003
IEEE
16 years 3 hour ago
An Approach to Developing Information Dissemination Service for Ubiquitous Computing Applications
In many ubiquitous computing (ubicomp) applications, such as smart classrooms, hospitals, construction sites, stadiums, shopping malls, emergency services, law enforcement, conven...
Stephen S. Yau, Sheikh Iqbal Ahamed