1383 search results - page 119 / 277 » On the Complexity of the Interlace Polynomial |
208
click to vote
DIS
2007
Springer
15 years 10 months ago
2007
Springer
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
183
click to vote
CISC
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we investigate the problem of increasing the threshold parameter of the Shamir (t, n)-threshold scheme without interacting with the dealer. Our construction will re...
157
click to vote
SIAMJO
2000
15 years 6 months ago
2000
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
132
click to vote
TOG
2010
15 years 1 months ago
2010
This paper introduces a fully-Eulerian interface tracking framework that preserves the fine details of liquids. Unlike existing Eulerian methods, the proposed framework shows good...
159
click to vote
ICIP
1998
IEEE
16 years 7 months ago
1998
IEEE
A method has beenproposed for blindly estimating the Point Spread Function (PSF) of video data. The PSF's of the images in a sequence are assumed to be of compact support and...