Sciweavers

8825 search results - page 71 / 1765
» All for one or one for all
Sort
View
ICFEM
2009
Springer
15 years 7 months ago
Circular Coinduction with Special Contexts
Coinductive proofs of behavioral equivalence often require human ingenuity, in that one is expected to provide a “good” relation extending one’s goal with additional lemmas, ...
Dorel Lucanu, Grigore Rosu
ECML
2005
Springer
15 years 6 months ago
Learning from Positive and Unlabeled Examples with Different Data Distributions
Abstract. We study the problem of learning from positive and unlabeled examples. Although several techniques exist for dealing with this problem, they all assume that positive exam...
Xiaoli Li, Bing Liu
ICISC
2008
123views Cryptology» more  ICISC 2008»
15 years 2 months ago
The Swiss-Knife RFID Distance Bounding Protocol
Relay attacks are one of the most challenging threats RFID will have to face in the close future. They consist in making the verifier believe that the prover is in its close vicini...
Chong Hee Kim, Gildas Avoine, François Koeu...
JGT
2007
81views more  JGT 2007»
15 years 1 months ago
Pathwidth of outerplanar graphs
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved...
David Coudert, Florian Huc, Jean-Sébastien ...
ARC
2008
Springer
126views Hardware» more  ARC 2008»
15 years 3 months ago
DNA Physical Mapping on a Reconfigurable Platform
Reconfigurable architectures enable the hardware function to be implemented by the user and, due to its characteristics, have been used in many areas, including Bioinformatics. One...
Adriano Idalgo, Nahri Moreano