Sciweavers

736 search results - page 25 / 148
» Approximating the Number of Network Motifs
Sort
View
IWANN
2005
Springer
15 years 3 months ago
Input and Structure Selection for k-NN Approximator
Abstract. This paper presents k-NN as an approximator for time series prediction problems. The main advantage of this approximator is its simplicity. Despite the simplicity, k-NN c...
Antti Sorjamaa, Nima Reyhani, Amaury Lendasse
ALGORITHMICA
1999
102views more  ALGORITHMICA 1999»
14 years 9 months ago
Approximating Latin Square Extensions
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
Ravi Kumar, Alexander Russell, Ravi Sundaram
ICIP
2002
IEEE
15 years 11 months ago
Fitting smooth surfaces to scattered 3D data using piecewise quadratic approximation
The approximation of surfaces to scattered data is an important problem encountered in a variety of scientific applications, such as reverse engineering, computer vision, computer...
Hélio Pedrini, Murilo Vicente Gonçal...
IROS
2008
IEEE
116views Robotics» more  IROS 2008»
15 years 4 months ago
Selection of robot pre-grasps using box-based shape approximation
— Grasping is a central issue of various robot applications, especially when unknown objects have to be manipulated by the system. In earlier work, we have shown the efficiency ...
Kai Huebner, Danica Kragic
UAI
2003
14 years 11 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin