Sciweavers

7123 search results - page 225 / 1425
» The Ordered Set of Rough Sets
Sort
View
ICML
1997
IEEE
16 years 7 months ago
Automatic Rule Acquisition for Spelling Correction
This paper describes a new approach to automatically learning linguistic knowledge for spelling correction. A major feature of this approach is the fact that the acquired knowledg...
Lidia Mangu, Eric Brill
CORR
2002
Springer
122views Education» more  CORR 2002»
15 years 6 months ago
On alternative approach for verifiable secret sharing
The proposed approach works for any underlying secret sharing scheme. It is based on the concept of verification sets of participants, related to authorized set of participants. T...
Kamil Kulesza, Zbigniew Kotulski, Josef Pieprzyk
DEXA
2009
Springer
177views Database» more  DEXA 2009»
16 years 1 months ago
A Versatile Record Linkage Method by Term Matching Model Using CRF
We solve the problem of record linkage between databases where record fields are mixed and permuted in different ways. The solution method uses a conditional random fields model...
Quang Minh Vu, Atsuhiro Takasu, Jun Adachi
IV
2008
IEEE
155views Visualization» more  IV 2008»
16 years 29 days ago
Visualise Undrawable Euler Diagrams
Given a group of overlapping sets, it is not always possible to represent it with Euler diagrams. Euler diagram characteristics might collide with the sets relationships to depict...
Paolo Simonetto, David Auber
RTA
2005
Springer
16 years 2 days ago
Leanest Quasi-orderings
A convenient method for defining a quasi-ordering, such as those used for proving termination of rewriting, is to choose the minimum of a set of quasi-orderings satisfying some d...
Nachum Dershowitz, E. Castedo Ellerman