Sciweavers

2490 search results - page 407 / 498
» The Generalized Theory of Model Preference
Sort
View
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
14 years 2 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
PPDP
2005
Springer
14 years 2 months ago
Trace effects and object orientation
fects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type and eff...
Christian Skalka
COMPGEOM
2004
ACM
14 years 2 months ago
Inner and outer rounding of set operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
Olivier Devillers, Philippe Guigue
COMPGEOM
2004
ACM
14 years 2 months ago
An empirical comparison of techniques for updating Delaunay triangulations
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
Leonidas J. Guibas, Daniel Russel
COMPGEOM
2004
ACM
14 years 2 months ago
Approximate convex decomposition of polygons
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
Jyh-Ming Lien, Nancy M. Amato