3690 search results - page 518 / 738 » Computation with classical sequents |
151
Voted
EDBT
2009
ACM
16 years 9 days ago
2009
ACM
In this work we concentrate on categorization of relational attributes based on their data type. Assuming that attribute type/characteristics are unknown or unidentifiable, we an...
191
click to vote
CAIP
2009
Springer
16 years 3 days ago
2009
Springer
This paper describes a comprehensive approach to extract a common feature set from the image sequences. We use simple features which are easily extracted from a 3D wireframe model ...
184
click to vote
COCO
2009
Springer
16 years 2 days ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
156
click to vote
FSTTCS
2009
Springer
16 years 2 days ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
180
click to vote
IWCIA
2009
Springer
16 years 2 days ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...