439 search results - page 68 / 88 » Choiceless Computation and Symmetry |
141
click to vote
PODC
2011
ACM
14 years 15 days ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
VLSID
1999
IEEE
15 years 1 months ago
1999
IEEE
Residue Number System based applications involve modulo-arithmetic which is typically implemented using look-up-tables (LUTs) for a small value of modulus. In this paper, we prese...
AUTOMATICA
2008
14 years 9 months ago
2008
In this paper we show how the symmetry present in many linear systems can be exploited to significantly reduce the computational effort required for controller synthesis. This app...
DAM
2006
14 years 9 months ago
2006
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
113
click to vote
3DOR
2008
14 years 10 months ago
2008
We present an automatic face recognition approach, which relies on the analysis of the three-dimensional facial surface. The proposed approach consists of two basic steps, namely ...