Sciweavers

49 search results - page 4 / 10
» Self-Stabilizing Distributed Algorithm for Strong Matching i...
Sort
View
JGAA
2000
179views more  JGAA 2000»
13 years 5 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao

Publication
200views
12 years 5 months ago
Tracking Endocardial Motion via Multiple Model Filtering of Distribution Cut
Tracking heart motion plays an essential role in the diagnosis of cardiovascular diseases. As such, accurate characterization of dynamic behavior of the left ventricle (LV) is esse...
Kumaradevan Punithakumar, Ismail Ben Ayed, Ali Isl...
CORR
2006
Springer
85views Education» more  CORR 2006»
13 years 6 months ago
Discovering Network Topology in the Presence of Byzantine Faults
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
Mikhail Nesterenko, Sébastien Tixeuil
ACSC
2006
IEEE
14 years 3 days ago
Pruning subscriptions in distributed publish/subscribe systems
Publish/subscribe systems utilize filter algorithms to determine all subscriptions matching incoming event messages. To distribute such services, subscriptions are forwarded to s...
Sven Bittner, Annika Hinze
WOA
2010
13 years 3 months ago
Using Mobile Agents for Secure Biometric Authentication
This paper deals with the definition of a strong authentication model, coupling usual password/PIN based methods with a biometric matching, over a Multi Agent distributed infrastru...
Marco Tranquillin, Carlo Ferrari, Michele Moro