475 search results - page 65 / 95 » Z3-Connectivity with Independent Number 2 |
SWAT
2000
Springer
14 years 1 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
TCS
2008
13 years 10 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
COMGEO
2011
ACM
13 years 5 months ago
2011
ACM
We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...
SODA
2008
ACM
13 years 11 months ago
2008
ACM
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
BIOID
2008
13 years 12 months ago
2008
Abstract. In this paper we describe a number of experiments relating to PCAbased palmprint and face recognition. The experiments were designed to determine the influence of differe...