Sciweavers

1154 search results - page 165 / 231
» Mathematizing C concurrency
Sort
View
PODC
2010
ACM
14 years 1 months ago
A new technique for distributed symmetry breaking
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
Johannes Schneider, Roger Wattenhofer
BIOID
2008
149views Biometrics» more  BIOID 2008»
13 years 11 months ago
Additive Block Coding Schemes for Biometric Authentication with the DNA Data
Abstract. To implement a biometric authentication scheme, the templates of a group of people are stored in the database (DB) under the names of these people. Some person presents a...
Vladimir B. Balakirsky, Anahit R. Ghazaryan, A. J....
GECCO
2008
Springer
146views Optimization» more  GECCO 2008»
13 years 10 months ago
A formal performance modeling framework for bio-inspired ad hoc routing protocols
Bio-inspired ad hoc routing is an active area of research. The designers of these algorithms predominantly evaluate the performance of their protocols with the help of simulation ...
Muhammad Saleem, Syed Ali Khayam, Muddassar Farooq
CAGD
2006
114views more  CAGD 2006»
13 years 9 months ago
Jet subdivision schemes on the k-regular complex
We introduce a new family of subdivision schemes called jet subdivision schemes. Jet subdivision schemes are a natural generalization of the commonly used subdivision schemes for ...
Yonggang Xue, Thomas P.-Y. Yu, Tom Duchamp
DM
2006
82views more  DM 2006»
13 years 9 months ago
On the extension of vertex maps to graph homomorphisms
A reflexive graph is a simple undirected graph where a loop has been added at each vertex. If G and H are reflexive graphs and U V (H), then a vertex map f : U V (G) is called n...
Geir Agnarsson, Li Chen