Sciweavers

2137 search results - page 350 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
PPSN
2004
Springer
14 years 1 months ago
An Improved Evaluation Function for the Bandwidth Minimization Problem
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our ...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
ASWC
2006
Springer
13 years 11 months ago
Finding Important Vocabulary Within Ontology
In current Semantic Web community, some researches have been done on ranking ontologies, while very little is paid to ranking vocabularies within ontology. However, finding importa...
Xiang Zhang, Hongda Li, Yuzhong Qu
ASAP
2008
IEEE
105views Hardware» more  ASAP 2008»
13 years 9 months ago
Fast custom instruction identification by convex subgraph enumeration
Automatic generation of custom instruction processors from high-level application descriptions enables fast design space exploration, while offering very favorable performance and...
Kubilay Atasu, Oskar Mencer, Wayne Luk, Can C. &Ou...
AAAI
2010
13 years 9 months ago
Dominance Testing via Model Checking
Dominance testing, the problem of determining whether an outcome is preferred over another, is of fundamental importance in many applications. Hence, there is a need for algorithm...
Ganesh Ram Santhanam, Samik Basu, Vasant Honavar
NIPS
2003
13 years 9 months ago
Discriminative Fields for Modeling Spatial Dependencies in Natural Images
In this paper we present Discriminative Random Fields (DRF), a discriminative framework for the classification of natural image regions by incorporating neighborhood spatial depe...
Sanjiv Kumar, Martial Hebert