1054 search results - page 48 / 211 » Determining Computing Science's Role |
152
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In partic...
163
click to vote
GI
2004
Springer
15 years 11 months ago
2004
Springer
: Wireless Local Area Networks (WLAN) do not only provide a means for wireless communication, they can also supply terminal positions to location-aware services and applications. T...
171
click to vote
DRUMS
1998
Springer
15 years 10 months ago
1998
Springer
In this paper logical techniques developed to formalise the analysis of multi-interpretable information, in particular belief set operators and selection operators, are applied to...
132
click to vote
MFCS
1993
Springer
15 years 10 months ago
1993
Springer
We prove (for fixed k) that at least 1 k−1 (n 2 ) − O(n) equality tests and no more than 2 k (n 2 )+O(n) equality tests are needed in the worst case to determine whether a giv...
155
click to vote
FOCS
1998
IEEE
15 years 9 months ago
1998
IEEE
It is known that there exists a PCP characterization of NP where the verifier makes 3 queries and has a onesided error that is bounded away from 1; and also that 2 queries do not ...