522 search results - page 25 / 105 » The 3-Steiner Root Problem |
VLDB
1999
ACM
14 years 27 days ago
1999
ACM
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, resp...
ACL
2004
13 years 10 months ago
2004
This paper proposes a new approach for coreference resolution which uses the Bell tree to represent the search space and casts the coreference resolution problem as finding the be...
LISA
2001
13 years 10 months ago
2001
After installing an OS distribution, a computer is generally not yet properly adapted to go into production at the local site. Security policies must be implemented, local service...
NIPS
2001
13 years 10 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
ACISP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. Privacy presents many puzzles. In particular, why is it eroding, given the high value people assign to their privacy? This extended argues that there are strong incentive...