Sciweavers

2434 search results - page 209 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
ECAI
2006
Springer
15 years 8 months ago
How to Analyze Free Text Descriptions for Recommending TV Programmes?
ct This paper presents an approach to exploit free text descriptions of TV programmes as available from EPG data sets for a recommendation system that takes the content of programm...
Bernd Ludwig, Stefan Mandl
CADE
2008
Springer
15 years 6 months ago
Aligator: A Mathematica Package for Invariant Generation (System Description)
We describe the new software package Aligator for automatically inferring polynomial loop invariants. The package combines algorithms from symbolic summation and polynomial algebra...
Laura Kovács
SCANGIS
2001
15 years 5 months ago
Improving relief classification with contextual merging
Automatic classification of relief attributes into meaningful morphological units has a great potential within the field of geomorphology. When applying common classification algor...
Bård Romstad
CORR
2008
Springer
92views Education» more  CORR 2008»
15 years 4 months ago
On sign conditions over real multivariate polynomials
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a fami...
Gabriela Jeronimo, Daniel Perrucci, Juan Sabia
DAM
2002
82views more  DAM 2002»
15 years 3 months ago
On the computational complexity of strong edge coloring
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
Mohammad Mahdian