1450 search results - page 106 / 290 » On the Complexity of Hardness Amplification |
WG
2007
Springer
14 years 3 months ago
2007
Springer
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
LICS
2006
IEEE
14 years 3 months ago
2006
IEEE
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...
ACMSE
2006
ACM
14 years 3 months ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
ICTAI
2005
IEEE
14 years 2 months ago
2005
IEEE
Lotos is the ISO formal specification language for describing and verifying concurrent and distributed systems. The simulation or execution of complex Lotos specifications is, h...
ISCAS
2005
IEEE
14 years 2 months ago
2005
IEEE
Although many researches have investigated transparent scrambling video techniques, an issue of which transcoding relates to downsizing scrambled video without unscrambling has ha...