Sciweavers

43 search results - page 3 / 9
» Generic Polynomials with Few Parameters
Sort
View
ALT
2004
Springer
14 years 2 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
CSFW
2006
IEEE
14 years 19 hour ago
Simulation-Based Security with Inexhaustible Interactive Turing Machines
Recently, there has been much interest in extending models for simulation-based security in such a way that the runtime of protocols may depend on the length of their input. Findi...
Ralf Küsters
TSMC
2010
13 years 19 days ago
Uncertainty Evaluation Through Mapping Identification in Intensive Dynamic Simulations
We study how the dependence of a simulation output on an uncertain parameter can be determined, when simulations are computationally expensive and so can only be run for very few p...
Yan Wan, Sandip Roy, Bernard C. Lesieutre
CVPR
1999
IEEE
14 years 8 months ago
Generic Object Detection using Model Based Segmentation
This paper presents a novel approach for detection and segmentation of generic shapes in cluttered images. The underlying assumption is that generic objects that are man made, fre...
Zhiqian Wang, Jezekiel Ben-Arie
ADG
2006
Springer
177views Mathematics» more  ADG 2006»
13 years 12 months ago
Recognition of Computationally Constructed Loci
Abstract. We propose an algorithm for automated recognition of computationally constructed curves and discuss several aspects of the recognition problem. Recognizing loci means det...
Peter Lebmeir, Jürgen Richter-Gebert