Sciweavers

86 search results - page 3 / 18
» Polytope-based computation of polynomial ranges
Sort
View
ISMB
2001
13 years 11 months ago
Designing fast converging phylogenetic methods
Abstract: Absolute fast converging phylogenetic reconstruction methods are provably guaranteed to recover the true tree with high probability from sequences that grow only polynomi...
Luay Nakhleh, Usman Roshan, Katherine St. John, Je...
ECCV
2006
Springer
14 years 11 months ago
Direct Solutions for Computing Cylinders from Minimal Sets of 3D Points
Efficient direct solutions for the determination of a cylinder from points are presented. The solutions range from the well known direct solution of a quadric to the minimal soluti...
Christian Beder, Wolfgang Förstner
ICALP
1998
Springer
14 years 1 months ago
A Neuroidal Architecture for Cognitive Computation
An architecture is described for designing systems that acquire and manipulate large amounts of unsystematized, or so-called commonsense, knowledge. Its aim is to exploit to the fu...
Leslie G. Valiant
FOSSACS
2007
Springer
14 years 4 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
ALGORITHMICA
2010
72views more  ALGORITHMICA 2010»
13 years 10 months ago
Largest and Smallest Convex Hulls for Imprecise Points
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...
Maarten Löffler, Marc J. van Kreveld