1176 search results - page 129 / 236 » Implicit Abstraction Heuristics |
104
click to vote
SC
2003
ACM
15 years 6 months ago
2003
ACM
Demand for programming environments to exploit clusters of symmetric multiprocessors (SMPs) is increasing. In this paper, we present a new programming environment, called ParADE, ...
144
Voted
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. This paper presents a simple, yet effective method of building a codebook for pairs of spatially close SIFT descriptors. Integrating such codebook into the popular bag-o...
116
Voted
GMP
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract. Semi-algebraic sets occur naturally when dealing with implicit models and boolean operations between them. In this work we present an algorithm to efficiently and in a ce...
CPM
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
117
Voted
SIGGRAPH
2010
ACM
15 years 5 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...