Sciweavers

2938 search results - page 204 / 588
» On obfuscating point functions
Sort
View
PAMI
2006
99views more  PAMI 2006»
15 years 6 months ago
A New Convexity Measure Based on a Probabilistic Interpretation of Images
In this article we present a novel convexity measure for object shape analysis. The proposed method is based on the idea of generating pairs of points from a set, and measuring th...
Esa Rahtu, Mikko Salo, Janne Heikkilä
JIRS
2007
134views more  JIRS 2007»
15 years 6 months ago
Improving Robustness of Mobile Robots Using Model-based Reasoning
Retaining functionality of a mobile robot in the presence of faults is of particular interest in autonomous robotics. From our experiences in robotics we know that hardware is one ...
Michael W. Hofbaur, Johannes Köb, Gerald Stei...
CAD
1999
Springer
15 years 6 months ago
The intersection of two ruled surfaces
This article presents an efficient and robust algorithm that computes the intersection curve of two ruled surfaces. The surface intersection problem is reformulated as a zero-set ...
Hee-Seok Heo, Myung-Soo Kim, Gershon Elber
NECO
2002
78views more  NECO 2002»
15 years 6 months ago
Local Overfitting Control via Leverages
We present a novel approach to dealing with overfitting in black-box models. It is based on the leverages of the samples, i.e. on the influence that each observation has on the pa...
Gaétan Monari, Gérard Dreyfus
SIAMCOMP
1998
141views more  SIAMCOMP 1998»
15 years 6 months ago
Randomized Data Structures for the Dynamic Closest-Pair Problem
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
Mordecai J. Golin, Rajeev Raman, Christian Schwarz...