Sciweavers

2397 search results - page 179 / 480
» Applications of integer relation algorithms
Sort
View
KES
2007
Springer
16 years 19 days ago
A Hierarchical Clustering Method for Semantic Knowledge Bases
Abstract. This work presents a clustering method which can be applied to relational knowledge bases. Namely, it can be used to discover interesting groupings of semantically annota...
Nicola Fanizzi, Claudia d'Amato
JCIT
2008
78views more  JCIT 2008»
15 years 6 months ago
A Study on Web Caching based on Reference Characteristics of Web Objects
There are various web caching replacement algorithms related to reference characteristics of web objects were researched. They could be used in regard to user characteristics of c...
Yun Ji Na, Sarvar R. Abdullaev, Il Seok Ko
PODS
2003
ACM
158views Database» more  PODS 2003»
16 years 6 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
COCOA
2007
Springer
16 years 20 days ago
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...
ACSC
2005
IEEE
16 years 4 days ago
A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization
Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping n...
Xiaodi Huang, Peter Eades, Wei Lai