Sciweavers

2080 search results - page 56 / 416
» Collections, Cardinalities, and Relations
Sort
View
IJKESDP
2010
149views more  IJKESDP 2010»
15 years 4 months ago
An approximate solution method based on tabu search for k-minimum spanning tree problems
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishiz...
COMMA
2010
15 years 1 months ago
Expanding Argumentation Frameworks: Enforcing and Monotonicity Results
This paper addresses the problem of revising a Dung-style argumentation framework by adding finitely many new arguments which may interact with old ones. We study the behavior of t...
Ringo Baumann, Gerhard Brewka
MLDM
2009
Springer
16 years 22 days ago
Relational Frequent Patterns Mining for Novelty Detection from Data Streams
We face the problem of novelty detection from stream data, that is, the identification of new or unknown situations in an ordered sequence of objects which arrive on-line, at cons...
Michelangelo Ceci, Annalisa Appice, Corrado Loglis...
ICCCI
2009
Springer
15 years 10 months ago
On Deriving Tagsonomies: Keyword Relations Coming from Crowd
Abstract. Many keyword-based approaches to text classification, information retrieval or even user modeling for adaptive web-based system could benefit from knowledge on relation...
Michal Barla, Mária Bieliková
ICSE
2003
IEEE-ACM
16 years 6 months ago
Component Rank: Relative Significance Rank for Software Component Search
Collections of already developed programs are important resources for efficient development of reliable software systems. In this paper, we propose a novel method of ranking softw...
Katsuro Inoue, Reishi Yokomori, Hikaru Fujiwara, T...