451 search results - page 31 / 91 » Relationless Completeness and Separations |
128
Voted
ICCAD
2006
IEEE
16 years 12 days ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
139
Voted
CGF
2007
15 years 3 months ago
2007
We present a new, single-rate method for compressing the connectivity information of a connected 2-manifold triangle mesh with or without boundary. Traditional compression schemes...
145
click to vote
ICA
2010
Springer
15 years 4 months ago
2010
Springer
Independent Component Analysis is the best known method for solving blind source separation problems. In general, the number of sources must be known in advance. In many cases, pre...
149
Voted
LICS
1990
IEEE
15 years 7 months ago
1990
IEEE
Reasoning about permissions and obligations sometimes requires to distinguish more than one level of permission: certain actions are preferable to others, or one has more confiden...
90
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract: This document contains the Intellectual Property Statement and the technical description of the MQQ-SIG - a new public key digital signature scheme. The complete scientif...