54 search results - page 11 / 11 » An Algorithm for Solving the Discrete Log Problem on Hyperel... |
CPM
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
SMA
2009
ACM
13 years 11 months ago
2009
ACM
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
PODC
2006
ACM
13 years 11 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
CGF
2010
13 years 5 months ago
2010
This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but re...