1302 search results - page 234 / 261 » On the Strong Chromatic Number |
172
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
163
click to vote
APLAS
2000
ACM
15 years 10 months ago
2000
ACM
We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explici...
185
click to vote
ELPUB
2000
ACM
15 years 10 months ago
2000
ACM
This paper describes part of the results of recent research carried out in Brazil and the UK, which investigated the perceptions by academic social scientists of the impact of ele...
176
click to vote
ANTS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
142
click to vote
SIGIR
1999
ACM
15 years 10 months ago
1999
ACM
Abstract We compare the performance of two database selection algorithms reported in the literature. Their performance is compared using a common testbed designed specifically for ...