65 search results - page 8 / 13 » Graph Automorphism-Based Algorithm for Determining Symmetric... |
ICMCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider the problem of packetizing a variable length coded Markov sequence into fixed length packets, while being protected by variable rate channel code. Given the total tra...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
ISMAR
2007
IEEE
14 years 1 months ago
2007
IEEE
We present an efficient and accurate object tracking algorithm based on the concept of graph cut segmentation. The ability to track visible objects in real-time provides an inval...
PODC
2011
ACM
12 years 10 months ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
P2P
2002
IEEE
14 years 9 days ago
2002
IEEE
Semantic Web Services are a promising combination of Semantic Web and Web service technology, aiming at providing means of automatically executing, discovering and composing seman...