2799 search results - page 179 / 560 » computing 1998 |
124
click to vote
FOCS
1998
IEEE
15 years 7 months ago
1998
IEEE
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
109
click to vote
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...
104
click to vote
CONCUR
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. This paper introduces a compositional Hoare logics for reasoning about the correctness of systems composed of a dynamically evolving collection of processes (also called ...
104
click to vote
TCS
1998
15 years 2 months ago
1998
The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be see...
BMVC
1998
15 years 4 months ago
1998
A new technique is presented for determining the positions where a range sensor should be located to acquire the surfaces of a complex scene. The algorithm consists of two stages....