Sciweavers

475 search results - page 90 / 95
» Z3-Connectivity with Independent Number 2
Sort
View
COMGEO
2006
ACM
15 years 5 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
EJC
2007
15 years 5 months ago
Deterministic random walks on the integers
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer,...
BIOINFORMATICS
2000
149views more  BIOINFORMATICS 2000»
15 years 5 months ago
MaxSub: an automated measure for the assessment of protein structure prediction quality
Motivation: Evaluating the accuracy of predicted models is critical for assessing structure prediction methods. Because this problem is not trivial, a large number of different as...
Naomi Siew, Arne Elofsson, Leszek Rychlewski, Dani...
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
15 years 10 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
EUROCRYPT
2007
Springer
15 years 9 months ago
Batch Verification of Short Signatures
Abstract. With computer networks spreading into a variety of new environments, the need to authenticate and secure communication grows. Many of these new environments have particul...
Jan Camenisch, Susan Hohenberger, Michael Ø...