7351 search results - page 1422 / 1471 » Segmenting Point Sets |
KDD
2009
ACM
14 years 6 days ago
2009
ACM
Overall performance of the data mining process depends not just on the value of the induced knowledge but also on various costs of the process itself such as the cost of acquiring...
CCO
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...
CCS
2001
ACM
14 years 4 days ago
2001
ACM
Automated trust negotiation is an approach to establishing trust between strangers through the exchange of digital credentials and the use of access control policies that specify ...
MFCS
2001
Springer
14 years 2 days ago
2001
Springer
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
CGI
2000
IEEE
14 years 2 days ago
2000
IEEE
Computer synthesized characters are expected to make appropriate face, limb, and body gestures during communicative acts. We focus on non-facial movements and try to elucidate wha...