13987 search results - page 541 / 2798 » The Two Guards Problem |
205
click to vote
FSTTCS
2003
Springer
16 years 12 days ago
2003
Springer
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
217
click to vote
COMPGEOM
2010
ACM
16 years 8 days ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
164
click to vote
VLDB
2001
ACM
15 years 11 months ago
2001
ACM
Dynamically generated web pages are ubiquitous today but their high demand for resources creates a huge scalability problem at the servers. Traditional web caching is not able to ...
194
click to vote
COLT
2000
Springer
15 years 11 months ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
210
click to vote
AGP
1999
IEEE
15 years 11 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...