Sciweavers

4009 search results - page 514 / 802
» Clustering on Complex Graphs
Sort
View
ICIP
2001
IEEE
16 years 8 months ago
Curves vs skeletons in object recognition
The type of representation used in describing shape can have a significant impact on the effectiveness of a recognition strategy. Shape has been represented by its bounding curve ...
Thomas B. Sebastian, Benjamin B. Kimia
DAC
2004
ACM
16 years 7 months ago
Synthesizing interconnect-efficient low density parity check codes
Error correcting codes are widely used in communication and storage applications. Codec complexity has usually been measured with a software implementation in mind. A recent hardw...
Marghoob Mohiyuddin, Amit Prakash, Adnan Aziz, Way...
ICALP
2009
Springer
16 years 7 months ago
A Survey of Stochastic Games with Limsup and Liminf Objectives
A stochastic game is a two-player game played on a graph, where in each state the successor is chosen either by one of the players, or according to a probability distribution. We s...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
STACS
2009
Springer
16 years 1 months ago
Tractable Structures for Constraint Satisfaction with Truth Tables
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
Dániel Marx
CSE
2009
IEEE
16 years 1 months ago
Modelling of Pseudonymity under Probabilistic Linkability Attacks
—This paper contributes to the field of measuring (un)linkability in communication systems; a subproblem of privacy protection. We propose an attacker state model for attacks on...
Martin Neubauer