144 search results - page 24 / 29 » Algorithms for Maximum Satisfiability using Unsatisfiable Co... |
COLT
2004
Springer
13 years 11 months ago
2004
Springer
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...
BMVC
2010
13 years 5 months ago
2010
We present a framework for the reduction of dimensionality of a data set via manifold learning. Using the building blocks of local hyperplanes we show how a global manifold can be...
MSWIM
2003
ACM
14 years 22 days ago
2003
ACM
The seamless communication of data and voice over short-range, point-to-multipoint wireless links between mobile and/or stationary devices is becoming a reality by newly introduce...
IROS
2007
IEEE
14 years 1 months ago
2007
IEEE
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
IJNSEC
2011
13 years 2 months ago
2011
In this paper, cyclic elliptic curves of the form y2 + xy = x3 + ax2 + b, a, b ∈ GF(2m ) with order M is considered in the design of a Symmetric Key Image Encryption Scheme with...