3778 search results - page 42 / 756 » Erdos-Ko-Rado for three sets |
90
Voted
IJRR
2008
15 years 21 days ago
2008
: We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible...
123
Voted
DATAMINE
2010
15 years 24 days ago
2010
In this paper, we investigate how to modify the Naive Bayes classifier in order to perform classification that is restricted to be independent with respect to a given sensitive att...
CCR
2006
15 years 23 days ago
2006
We calculate an extensive set of characteristics for Internet AS topologies extracted from the three data sources most frequently used by the research community: traceroutes, BGP,...
136
Voted
APVIS
2007
15 years 2 months ago
2007
Direct volume rendering of large volumetric data sets on programmable graphics hardware is often limited by the amount of available graphics memory and the bandwidth from main mem...
CORR
2007
Springer
15 years 20 days ago
2007
Springer
Abstract. Holzer and Holzer [7] proved that the TantrixTM rotation puzzle problem with four colors is NP-complete, and they showed that the infinite variant of this problem is und...