Sciweavers

11211 search results - page 429 / 2243
» Rank-Sensitive Data Structures
Sort
View
ENTCS
2002
80views more  ENTCS 2002»
15 years 6 months ago
Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited
In this paper, we revisit the forward and backward approaches to the verification of extensions of infinite state Petri Nets. As contributions, we propose an efficient data struct...
Alain Finkel, Jean-François Raskin, Mathias...
NAR
2000
103views more  NAR 2000»
15 years 6 months ago
The Homeodomain Resource: a prototype database for a large protein family
The Homeodomain Resource is an annotated collection of non-redundant protein sequences, three-dimensional structures and genomic information for the homeodomain protein family. Re...
Sharmila Banerjee-Basu, Joseph F. Ryan, Andreas D....
IJFCS
2002
122views more  IJFCS 2002»
15 years 6 months ago
The Delaunay Hierarchy
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
Olivier Devillers
CORR
2010
Springer
228views Education» more  CORR 2010»
15 years 5 months ago
Sparse Inverse Covariance Selection via Alternating Linearization Methods
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...
Katya Scheinberg, Shiqian Ma, Donald Goldfarb
ICRA
2010
IEEE
126views Robotics» more  ICRA 2010»
15 years 5 months ago
Planning short paths with clearance using explicit corridors
— A central problem of applications dealing with virtual environments is planning a collision-free path for a character. Since environments and their characters are growing more ...
Roland Geraerts