3630 search results - page 173 / 726 » How to Compare Treebanks |
197
click to vote
ICIAP
1999
ACM
15 years 11 months ago
1999
ACM
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...
154
click to vote
SIGIR
1998
ACM
15 years 11 months ago
1998
ACM
We discuss two learning algorithms for text filtering: modified Rocchio and a boosting algorithm called AdaBoost. We show how both algorithms can be adapted to maximize any gene...
196
click to vote
SIGMOD
1998
ACM
15 years 11 months ago
1998
ACM
The functionality of extensible database servers can be augmented by user-de ned functions UDFs . However, the server's security and stability are concerns whenever new code...
186
Voted
RTSS
1997
IEEE
15 years 11 months ago
1997
IEEE
We present a method for providing response-time guarantees in Asynchronous Transfer Mode (ATM) networks. The method is based on traditional real-time CPU Response-Time Analysis (R...
158
click to vote
ISLPED
1996
ACM
15 years 11 months ago
1996
ACM
In this paper, we discuss on accuracy of several kinds of power dissipation model for CMOS VLSI circuits. Some researchers have proposed several efficient power estimation methods...