Sciweavers

1272 search results - page 236 / 255
» The Set Cover with Pairs Problem
Sort
View
FOCS
2009
IEEE
14 years 4 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...
IFIP
2009
Springer
14 years 4 months ago
Trusted Multiplexing of Cryptographic Protocols
Abstract. We present an analysis that determines when it is possible to multiplex a pair of cryptographic protocols. We present a transformation that improves the coverage of this ...
Jay A. McCarthy, Shriram Krishnamurthi
AUSAI
2003
Springer
14 years 3 months ago
Choosing Learning Algorithms Using Sign Tests with High Replicability
An important task in machine learning is determining which learning algorithm works best for a given data set. When the amount of data is small the same data needs to be used repea...
Remco R. Bouckaert
MVA
1990
123views Computer Vision» more  MVA 1990»
13 years 11 months ago
Randomized Hough Transform (RHT) in Engineering Drawing Vectorization System
Abstract When the data is processed from the digitized drawThis paper presents how the recently presented Randomized IIough Transform (RHT) method can be used as a part of an engin...
Pekka Kultanen, Erkki Oja, Lei Xu
BMCBI
2008
138views more  BMCBI 2008»
13 years 10 months ago
Using neural networks and evolutionary information in decoy discrimination for protein tertiary structure prediction
Background: We present a novel method of protein fold decoy discrimination using machine learning, more specifically using neural networks. Here, decoy discrimination is represent...
Ching-Wai Tan, David T. Jones