15 search results - page 3 / 3 » cla 2004 |
CLA
2004
13 years 6 months ago
2004
In Formal Concept Analysis, it is a very important but quite difficult task to draw line diagrams of concept lattices automatically. In particular, we want every planar lattice to ...
CLA
2004
13 years 6 months ago
2004
cessary to abstract it and eliminate the redundancy data. In this context, a method for data reduction based on the formal concept analysis is proposed in [16,17]. At the same time...
CLEF
2004
Springer
13 years 10 months ago
2004
Springer
This paper describes the Bulgarian part of a Bulgarian–English question answering system. The Bulgarian modules are implemented as a question analysis procedure within a Bulgari...
CSREAESA
2004
13 years 6 months ago
2004
Adders are some of the most critical data path circuits requiring considerable design effort in order to "squeeze" out as much performance gain as possible. Many adder d...
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...