4903 search results - page 82 / 981 » The Set Covering Machine |
TIT
1998
13 years 8 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
PREMI
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Approximation spaces are fundamental for the rough set approach. We discuss their application in machine learning and pattern recognition.
AML
2008
13 years 9 months ago
2008
We generalize ordinary register machines on natural numbers to machines whose registers contain arbitrary ordinals. Ordinal register machines are able to compute a recursive bounde...
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
NAACL
2007
13 years 10 months ago
2007
A new architecture for identifying and interpreting temporal expressions is introduced, in which the large set of complex hand-crafted rules standard in systems for this task is r...