AIM
1999
13 years 4 months ago
1999
The problem of learning is arguably at the very core of the problem of intelligence, both biological and artificial. In this paper we review our work over the last ten years in th...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from all other vertices by the set of vertices in C that are at distance at m...
CATS
2008
13 years 5 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
DIS
2000
Springer
13 years 8 months ago
2000
Springer
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
CONTEXT
2007
Springer
13 years 10 months ago
2007
Springer
The problem we address in this paper is the role of context in the interpretation of images when pictures are used as queries. An image usually depicts several objects and is open...
IV
2008
IEEE
13 years 10 months ago
2008
IEEE
There are already several tools available that are capable of visualizing RDF data. The problem with RDF data is that they tend to be very large. To handle the data, the visualize...
CISS
2008
IEEE
13 years 10 months ago
2008
IEEE
— Real equiangular tight frames can be especially useful in practice because of their structure. The problem is that very few of them are known. We will look at recent advances o...