Sciweavers

204 search results - page 16 / 41
» Parameterizations of Test Cover with Bounded Test Sizes
Sort
View
STACS
2001
Springer
15 years 3 months ago
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
Philipp Woelfel
MVA
1990
130views Computer Vision» more  MVA 1990»
14 years 11 months ago
An Adaptive Algorithm for Edge Detection with Subpixel Accuracy in Noisy Images
There is a tradeoff between noise insensitivity and accurate position in edge detection. This paper suggests an adaptivealgorithm which takes advantage of both LOG and NonLL filte...
Jesse S. Jin
GD
2004
Springer
15 years 4 months ago
Convex Drawings of 3-Connected Plane Graphs
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...
Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah
DAGM
2007
Springer
15 years 4 months ago
The Minimum Volume Ellipsoid Metric
We propose an unsupervised “local learning” algorithm for learning a metric in the input space. Geometrically, for a given query point, the algorithm finds the minimum volume ...
Karim T. Abou-Moustafa, Frank P. Ferrie
SEMWEB
2005
Springer
15 years 4 months ago
Combining RDF and Part of OWL with Rules: Semantics, Decidability, Complexity
This paper extends the model theory of RDF with rules, placing an emphasis on integration with OWL and decidability of entailstart from an abstract syntax that views a rule as a pa...
Herman J. ter Horst