Sciweavers

1022 search results - page 175 / 205
» Logspace Complexity of Functions and Structures
Sort
View
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
14 years 9 months ago
Fast Identification of Relational Constraint Violations
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
Amit Chandel, Nick Koudas, Ken Q. Pu, Divesh Sriva...
ICCAD
2006
IEEE
127views Hardware» more  ICCAD 2006»
14 years 4 months ago
Joint design-time and post-silicon minimization of parametric yield loss using adjustable robust optimization
Parametric yield loss due to variability can be effectively reduced by both design-time optimization strategies and by adjusting circuit parameters to the realizations of variable...
Murari Mani, Ashish Kumar Singh, Michael Orshansky
VTC
2008
IEEE
140views Communications» more  VTC 2008»
14 years 2 months ago
Diversity Combining of Signals with Different Modulation Levels in Cooperative Relay Networks
In digital cooperative relaying, signals from the source-destination and relay-destination links are combined at the destination to achieve spatial diversity. These signals do not ...
Akram Bin Sediq, Halim Yanikomeroglu
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
On Secure Multi-party Computation in Black-Box Groups
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
PREMI
2007
Springer
14 years 1 months ago
Discovery of Process Models from Data and Domain Knowledge: A Rough-Granular Approach
The rapid expansion of the Internet has resulted not only in the ever-growing amount of data stored therein, but also in the burgeoning complexity of the concepts and phenomena per...
Andrzej Skowron