3172 search results - page 115 / 635 » On the Random-Self-Reducibility of Complete Sets |
149
click to vote
ECSQARU
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. The issue of formalizing skepticism relations between argumentation semantics has been considered only recently in the literature. In this paper, we contribute to this ki...
167
click to vote
TIME
2006
IEEE
16 years 12 days ago
2006
IEEE
In this paper, we present our work on creating a complete set of rules for temporal arithmetic mixing months and days based on the “history-dependent intuition”. Many examples...
134
click to vote
CONEXT
2006
ACM
16 years 11 days ago
2006
ACM
This paper presents the MRCP (Modular Routing Control Platform), a routing control architecture that provides complete control and visibility of interdomain routing in a single AS...
169
click to vote
SAINT
2005
IEEE
15 years 12 months ago
2005
IEEE
Basket Analysis is mathematically characterized and extended to search families of sets in this paper. These theories indicate the possibility of various new approaches of data mi...
165
click to vote
CAIP
2005
Springer
15 years 12 months ago
2005
Springer
We consider simple cube-curves in the orthogonal 3D grid. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded set. The c...