Sciweavers

166 search results - page 29 / 34
» Complexity of Some Geometric and Topological Problems
Sort
View
NIPS
2001
13 years 10 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
COMPGEOM
2004
ACM
14 years 2 months ago
On empty convex polygons in a planar point set
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
Rom Pinchasi, Rados Radoicic, Micha Sharir
KR
2010
Springer
14 years 1 months ago
Finding the Next Solution in Constraint- and Preference-Based Knowledge Representation Formalisms
In constraint or preference reasoning, a typical task is to compute a solution, or an optimal solution. However, when one has already a solution, it may be important to produce th...
Ronen I. Brafman, Francesca Rossi, Domenico Salvag...
CAD
2000
Springer
13 years 8 months ago
Managing digital libraries for computer-aided design
This paper describes our initial efforts to deploy a digital library to support computer-aided collaborative design. At present, this experimental testbed, The Engineering Design ...
William C. Regli, Vincent A. Cicirello
ICCSA
2007
Springer
14 years 2 months ago
3D Spatial Operations in Geo DBMS Environment for 3D GIS
Next generation of GIS software should be able to manipulate and analyse complex situations of real world phenomena. One of the desired components in such software or system is the...
Chen Tet-Khuan, Alias Abdul-Rahman, Sisi Zlatanova