1390 search results - page 17 / 278 » Computing the depth of a flat |
65
Voted
CCCG
2006
14 years 11 months ago
2006
Soss proved that it is NP-hard to find the maximum flat span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These f...
78
Voted
COLING
2002
14 years 9 months ago
2002
This paper proposes a multi-dimensional framework for classifying text documents. In this framework, the concept of multidimensional category model is introduced for representing ...
CGI
2006
IEEE
15 years 3 months ago
2006
IEEE
A second order forward differences based subdivision depth computation technique for extra-ordinary Catmull-Clark subdivision surface (CCSS) patches is presented. The new techniqu...
105
click to vote
PRL
2006
14 years 9 months ago
2006
Depth computation is an attractive feature in computer vision. The use of traditional perspective cameras for panoramic perception requires several images, most likely implying th...
71
Voted
KDD
1998
ACM
15 years 1 months ago
1998
ACM
"Oneperson's noise is another person's signal." For manyapplications, including the detection of credit card frauds and the monitoringof criminal activities in...