Sciweavers

6881 search results - page 1356 / 1377
» Motivation
Sort
View
COMPGEOM
2011
ACM
12 years 11 months ago
Minors in random and expanding hypergraphs
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
Uli Wagner
CORR
2011
Springer
205views Education» more  CORR 2011»
12 years 11 months ago
Algorithms for Implicit Hitting Set Problems
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
Karthekeyan Chandrasekaran, Richard Karp, Erick Mo...
CVIU
2011
12 years 11 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...
DLOG
2011
12 years 11 months ago
Analysing Multiple Versions of an Ontology: A Study of the NCI Thesaurus
The detection of changes between OWL ontologies is an important service for ontology engineering. There are several approaches to this problem, both syntactic and semantic. A purel...
Rafael S. Gonçalves, Bijan Parsia, Ulrike S...
ESWA
2011
220views Database» more  ESWA 2011»
12 years 11 months ago
Unsupervised neural models for country and political risk analysis
This interdisciplinary research project focuses on relevant applications of Knowledge Discovery and Artificial Neural Networks in order to identify and analyse levels of country, b...
Álvaro Herrero, Emilio Corchado, Alfredo Ji...
« Prev « First page 1356 / 1377 Last » Next »