Sciweavers

4255 search results - page 305 / 851
» Cover
Sort
View
SAT
2007
Springer
146views Hardware» more  SAT 2007»
16 years 24 days ago
Algorithms for Variable-Weighted 2-SAT and Dual Problems
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...
Stefan Porschen, Ewald Speckenmeyer
WADS
2007
Springer
115views Algorithms» more  WADS 2007»
16 years 24 days ago
Alpha-Beta Witness Complexes
Building on the work of Martinetz, Schulten and de Silva, Carlsson, we introduce a 2-parameter family of witness complexes and algorithms for constructing them. This family can be ...
Dominique Attali, Herbert Edelsbrunner, John Harer...
WADS
2007
Springer
184views Algorithms» more  WADS 2007»
16 years 24 days ago
A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanj...
3DPVT
2006
IEEE
189views Visualization» more  3DPVT 2006»
16 years 23 days ago
Fast Safe Spline Surrogates for Large Point Clouds
To support real-time computation with large, possibly evolving point clouds and range data, we fit a trimmed uniform tensor-product spline function from one direction. The graph ...
Ashish Myles, Jörg Peters
ACSC
2006
IEEE
16 years 23 days ago
On pedagogically sound examples in public-key cryptography
Pencil-and-paper exercises in public-key cryptography are important in learning the subject. It is desirable that a student doing such an exercise does not get the right answer by...
Suan Khai Chong, Graham Farr, Laura Frost, Simon H...