Sciweavers

246 search results - page 33 / 50
» Bichain graphs: Geometric model and universal graphs
Sort
View
COMPGEOM
2010
ACM
15 years 4 months ago
On degrees in random triangulations of point sets
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
Micha Sharir, Adam Sheffer, Emo Welzl
SPAA
1990
ACM
15 years 3 months ago
Optimal Cooperative Search in Fractional Cascaded Data Structures
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...
Roberto Tamassia, Jeffrey Scott Vitter
ANOR
2008
66views more  ANOR 2008»
14 years 12 months ago
Optimization problems involving collections of dependent objects
We describe a class of problems motivated by numerous real-world applications where there is a collection of objects that have both a cost and a value, but where some of those obj...
David L. Roberts, Charles L. Isbell, Michael L. Li...
CPC
2002
95views more  CPC 2002»
14 years 11 months ago
Permutation Pseudographs And Contiguity
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...
Catherine S. Greenhill, Svante Janson, Jeong Han K...
TABLEAUX
1998
Springer
15 years 4 months ago
Model Checking: Historical Perspective and Example (Extended Abstract)
ple (Extended Abstract) Edmund M. Clarke and Sergey Berezin Carnegie Mellon University -- USA Model checking is an automatic verification technique for finite state concurrent syst...
Edmund M. Clarke, Sergey Berezin