12289 search results - page 499 / 2458 » computing 2006 |
170
Voted
ACL
2006
15 years 8 months ago
2006
This paper presents techniques to apply semi-CRFs to Named Entity Recognition tasks with a tractable computational cost. Our framework can handle an NER task that has long named e...
138
click to vote
JAR
1998
15 years 6 months ago
1998
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
117
click to vote
KI
2006
Springer
15 years 6 months ago
2006
Springer
We present an approach for solving proportional analogies of the form A : B :: C : D where a plausible outcome for D is computed. The core of the approach is E
200
click to vote
IJCGA
2006
15 years 6 months ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
149
click to vote
HAPTICS
2006
IEEE
16 years 23 days ago
2006
IEEE
We describe a tactile transducer system that has a compact, yet modular design. The tactile transducer comprises a 6×10 piezo bi