9842 search results - page 1854 / 1969 » The Complexity of the Matching-Cut Problem |
SIGGRAPH
2010
ACM
14 years 2 months ago
2010
ACM
This paper addresses the fundamental problem of computing stable medial representations of 3D shapes. We propose a spatially adaptive classification of geometric features that yi...
ICCS
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
ICDT
2001
ACM
14 years 2 months ago
2001
ACM
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
MMMACNS
2001
Springer
14 years 2 months ago
2001
Springer
The main cryptographic primitives (Bit Commitment (BC) and Oblivious Transfer (OT) protocols) based on noisy channels have been considered in [1] for asymptotic case. Non-asymptoti...
NOSSDAV
2001
Springer
14 years 2 months ago
2001
Springer
The heterogeneity of the Internet’s transmission resources and end system capability makes it difficult to agree on acceptable traffic characteristics among the multiple receive...