1055 search results - page 165 / 211 » Enumerations in computable structure theory |
CCS
2005
ACM
14 years 1 months ago
2005
ACM
This paper introduces the PeerAccess framework for reasoning about authorization in open distributed systems, and shows how a parameterization of the framework can be used to reas...
HICSS
1994
IEEE
13 years 12 months ago
1994
IEEE
Meeting research and especially research on Computer Supported Meetings of natural teams is not available in abundance. What is reported of meetings often uses a rather limited th...
COCO
2003
Springer
14 years 1 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
SWAT
2000
Springer
13 years 11 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...
BMCBI
2008
13 years 8 months ago
2008
Background: Accurate identification of splice sites in DNA sequences plays a key role in the prediction of gene structure in eukaryotes. Already many computational methods have be...