Sciweavers

3679 search results - page 320 / 736
» Answer set based design of knowledge systems
Sort
View
FUIN
2007
123views more  FUIN 2007»
15 years 6 months ago
Analysis of Approximate Petri Nets by Means of Occurrence Graphs
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
Zbigniew Suraj, Barbara Fryc
176
Voted
CIKM
2008
Springer
15 years 8 months ago
A metric cache for similarity search
Similarity search in metric spaces is a general paradigm that can be used in several application fields. It can also be effectively exploited in content-based image retrieval syst...
Fabrizio Falchi, Claudio Lucchese, Salvatore Orlan...
174
Voted
FPGA
2003
ACM
137views FPGA» more  FPGA 2003»
15 years 12 months ago
Customized regular channel design in FPGAs
FPGAs are one of the essential components in platform-based embedded systems. Such systems are customized and applied only to a limited set of applications. Also some applications...
Elaheh Bozorgzadeh, Majid Sarrafzadeh
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
16 years 3 days ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han
ICDE
2007
IEEE
125views Database» more  ICDE 2007»
16 years 1 months ago
Analyses and Fundamental ideas for a Relation Extraction Approach
Relation extraction is a difficult open research problem with important applications in several fields such as knowledge management, web mining, ontology building, intelligent sys...
Lobna Karoui, Marie-Aude Aufaure, Nacéra Be...