Sciweavers

1172 search results - page 133 / 235
» Approximate Reasoning Based on Similarity
Sort
View
JPDC
2007
138views more  JPDC 2007»
15 years 6 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki
JAIR
1998
81views more  JAIR 1998»
15 years 6 months ago
Computational Aspects of Reordering Plans
This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan le...
Christer Bäckström
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 10 months ago
The Bethe Permanent of a Non-Negative Matrix
:  The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
Pascal O. Vontobel
DATAMINE
2006
142views more  DATAMINE 2006»
15 years 6 months ago
Sequential Pattern Mining in Multi-Databases via Multiple Alignment
To efficiently find global patterns from a multi-database, information in each local database must first be mined and summarized at the local level. Then only the summarized infor...
Hye-Chung Kum, Joong Hyuk Chang, Wei Wang 0010
CSL
2004
Springer
15 years 6 months ago
Word sense disambiguation of WordNet glosses
This paper presents a suite of methods and results for the semantic disambiguation of WordNet glosses. WordNet is a resource widely used in natural language processing and artific...
Dan I. Moldovan, Adrian Novischi