Sciweavers

835 search results - page 29 / 167
» Geometric Logic in Computer Science
Sort
View
TCS
1998
13 years 8 months ago
Proving Possibility Properties
A method is described for proving “always possibly” properties of specifications in formalisms with linear-time trace semantics. It is shown to be relatively complete for TLA...
Leslie Lamport
CAD
2011
Springer
13 years 7 days ago
Principal curvature ridges and geometrically salient regions of parametric B-spline surfaces
Ridges are characteristic curves of a surface that mark salient intrinsic features of its shape and are therefore valuable for shape matching, surface quality control, visualizati...
Suraj Musuvathy, Elaine Cohen, James N. Damon, Joo...
FOCS
2009
IEEE
14 years 3 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...
STACS
2010
Springer
14 years 3 months ago
Named Models in Coalgebraic Hybrid Logic
Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic sem...
Lutz Schröder, Dirk Pattinson
SCCC
2005
IEEE
14 years 2 months ago
A geometric framework to visualize fuzzy-clustered data
— Fuzzy clustering methods have been widely used in many applications. These methods, including fuzzy k-means and Expectation Maximization, allow an object to be assigned to mult...
Yuanquan Zhang, Luis Rueda