Sciweavers

1522 search results - page 121 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
RTA
2005
Springer
14 years 2 months ago
Intruder Deduction for AC-Like Equational Theories with Homomorphisms
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
Pascal Lafourcade, Denis Lugiez, Ralf Treinen
ECCV
2004
Springer
14 years 2 months ago
Unbiased Errors-In-Variables Estimation Using Generalized Eigensystem Analysis
Recent research provided several new and fast approaches for the class of parameter estimation problems that are common in computer vision. Incorporation of complex noise model (mo...
Matthias Mühlich, Rudolf Mester
ENC
2003
IEEE
14 years 2 months ago
Efficient Compression from Non-ergodic Sources with Genetic Algorithms
Several lossless data compression schemes have been proposed over the past years. Since Shannon developed information theory in his seminal paper, however, the problem of data com...
Angel Fernando Kuri Morales
FCCM
2003
IEEE
113views VLSI» more  FCCM 2003»
14 years 2 months ago
Issues and Approaches to Coarse-Grain Reconfigurable Architecture Development
Although domain-specialized FPGAs can offer significant area, speed and power improvements over conventional reconfigurable devices, there are several unique and unexplored design...
Kenneth Eguro, Scott Hauck
CP
2003
Springer
14 years 2 months ago
Automated Mechanism Design: A New Application Area for Search Algorithms
Mechanism design is the art of designing the rules of the game (aka. mechanism) so that a desirable outcome (according to a given objective) is reached despite the fact that each a...
Tuomas Sandholm