9572 search results - page 335 / 1915 » Cover Algorithms and Their Combination |
162
click to vote
SAC
1997
ACM
15 years 11 months ago
1997
ACM
At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, w...
187
click to vote
WADS
1997
Springer
15 years 11 months ago
1997
Springer
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 ...
136
click to vote
HAPTICS
2010
IEEE
15 years 10 months ago
2010
IEEE
This paper presents a measure for assessing the perceived hardness of a haptic surface based on associated physical variables. This metric, named extended rate-hardness (ERH), is e...
188
click to vote
ANTS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We answer a question asked by Hajdu and Tengely: The only arithmetic progression in coprime integers of the form (a2 , b2 , c2 , d5 ) is (1, 1, 1, 1). For the proof, we ...
164
click to vote
ESOP
2009
Springer
15 years 10 months ago
2009
Springer
We describe the mechanisation of SLR parsing, covering background properties of context-free languages and grammars, as well as the construction of an SLR automaton. Among the vari...