Sciweavers

2496 search results - page 183 / 500
» On covering by translates of a set
Sort
View
WADS
2007
Springer
184views Algorithms» more  WADS 2007»
16 years 20 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...
IWPEC
2004
Springer
15 years 12 months ago
A Structural View on Parameterizing Problems: Distance from Triviality
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...
Jiong Guo, Falk Hüffner, Rolf Niedermeier
DATE
2002
IEEE
94views Hardware» more  DATE 2002»
15 years 11 months ago
Exact Grading of Multiple Path Delay Faults
The problem of fault grading for multiple path delay faults is studied and a method of obtaining the exact coverage is presented. The faults covered are represented and manipulate...
Saravanan Padmanaban, Spyros Tragoudas
UML
1998
Springer
15 years 10 months ago
Reflections on the Object Constraint Language
The object Constraint Language (OCL), which forms part of the UML set of modelling notations, is a precise, textual language for expressing constraints that cannot be shown diagram...
Ali Hamie, Franco Civello, John Howse, Stuart Kent...
WADS
1997
Springer
108views Algorithms» more  WADS 1997»
15 years 10 months ago
Dynamic Data Structures for Fat Objects and Their Applications
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha ...