Sciweavers

702 search results - page 27 / 141
» Identifying Graph Automorphisms Using Determining Sets
Sort
View
ICRA
2005
IEEE
103views Robotics» more  ICRA 2005»
14 years 2 months ago
Dimensioning a Constrained Parallel Robot to Reach a Set of Task Positions
— The paper considers the problem of setting the dimensions of a system of constrained parallel robots to ensure that together they can position an end-effector in a specified s...
Hai-Jun Su, J. Michael McCarthy
EJC
2007
13 years 8 months ago
Quickly deciding minor-closed parameters in general graphs
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
ICC
2007
IEEE
113views Communications» more  ICC 2007»
14 years 2 months ago
Analysis of Absorbing Sets for Array-Based LDPC Codes
— Low density parity check codes (LDPC) are known to perform very well under iterative decoding. However, these codes also exhibit a change in the slope of the bit error rate (BE...
Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Ma...
ICCS
2007
Springer
14 years 2 months ago
Learning Common Outcomes of Communicative Actions Represented by Labeled Graphs
We build a generic methodology based on learning and reasoning to detect specific attitudes of human agents and patterns of their interactions. Human attitudes are determined in te...
Boris Galitsky, Boris Kovalerchuk, Sergei O. Kuzne...
IPMI
2007
Springer
14 years 9 months ago
Comparing Pairwise and Simultaneous Joint Registrations of Decorrelating Interval Exams Using Entropic Graphs
The interest in registering a set of images has quickly risen in the field of medical image analysis. Mutual information (MI) based methods are well-established for pairwise regist...
Bing Ma, Ramkrishnan Narayanan, Hyunjin Park, Alfr...