Sciweavers

185 search results - page 18 / 37
» Constructions of Grassmannian Simplices
Sort
View
98
Voted
KI
1990
Springer
15 years 2 months ago
The Representation of Program Synthesis in Higher Order Logic
ue to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. ...
Christoph Kreitz
113
Voted
ADCM
2007
134views more  ADCM 2007»
14 years 10 months ago
Barycentric coordinates for convex sets
In this paper we provide an extension of barycentric coordinates from simplices to arbitrary convex sets. Barycentric coordinates over convex 2D polygons have found numerous appli...
Joe D. Warren, Scott Schaefer, Anil N. Hirani, Mat...
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
15 years 2 months ago
Local Computation of Nearly Additive Spanners
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent...
IPMI
2007
Springer
15 years 11 months ago
Shape Modeling and Analysis with Entropy-Based Particle Systems
This paper presents a new method for constructing compact statistical point-based models of ensembles of similar shapes that does not rely on any specific surface parameterization....
Joshua E. Cates, P. Thomas Fletcher, Martin Andrea...
ICML
2002
IEEE
15 years 11 months ago
Exact model averaging with naive Bayesian classifiers
The naive classifier is a well-established mathematical model whose simplicity, speed and accuracy have made it a popular choice for classification in AI and engineering. In this ...
Denver Dash, Gregory F. Cooper