Sciweavers

506 search results - page 17 / 102
» Proving Properties about Lists Using Containers
Sort
View
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
15 years 10 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
ICFEM
2009
Springer
15 years 4 months ago
Approximate Model Checking of PCTL Involving Unbounded Path Properties
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
Samik Basu, Arka P. Ghosh, Ru He
SACMAT
2010
ACM
15 years 2 months ago
An access control model for mobile physical objects
Access to distributed databases containing tuples collected about mobile physical objects requires information about the objects’ trajectories. Existing access control models ca...
Florian Kerschbaum
DCG
2008
118views more  DCG 2008»
14 years 9 months ago
General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
Jonathan Richard Shewchuk
CORR
2010
Springer
47views Education» more  CORR 2010»
14 years 8 months ago
Applications of Lindeberg Principle in Communications and Statistical Learning
We use a generalization of the Lindeberg principle developed by Sourav Chatterjee to prove universality properties for various problems in communications, statistical learning and...
Satish Babu Korada, Andrea Montanari