Sciweavers

3105 search results - page 303 / 621
» The Path-Packing Structure of Graphs
Sort
View
GD
2009
Springer
15 years 2 months ago
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios V...
171
Voted
ICRA
2007
IEEE
146views Robotics» more  ICRA 2007»
15 years 11 months ago
Crowds of Moving Objects: Navigation Planning and Simulation
Abstract— This paper presents a solution to interactive navigation planning and real-time simulation of a very large number of entities moving in a virtual environment. From the ...
Julien Pettré, Helena Grillon, Daniel Thalm...
SODA
1997
ACM
95views Algorithms» more  SODA 1997»
15 years 5 months ago
Randomly Sampling Molecules
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
Leslie Ann Goldberg, Mark Jerrum
ENTCS
2006
109views more  ENTCS 2006»
15 years 4 months ago
Specifications via Realizability
We present a system, called RZ, for automatic generation of program specifications from mathematical theories. We translate mathematical theories to specifications by computing th...
Andrej Bauer, Christopher A. Stone
153
Voted
COMBINATORICS
1998
84views more  COMBINATORICS 1998»
15 years 4 months ago
Multimatroids II. Orthogonality, minors and connectivity
A multimatroid is a combinatorial structure that encompasses matroids, delta-matroids and isotropic systems. This structure has been introduced to unify a theorem of Edmonds on th...
André Bouchet