Sciweavers

897 search results - page 51 / 180
» Identity: How to name it, How to find it
Sort
View
COMBINATORICS
2006
121views more  COMBINATORICS 2006»
13 years 8 months ago
Identifying Graph Automorphisms Using Determining Sets
A set of vertices S is a determining set for a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of a graph is the size of a sma...
Debra L. Boutin
JANCL
2006
112views more  JANCL 2006»
13 years 8 months ago
KAT-ML: an interactive theorem prover for Kleene algebra with tests
We describe KAT-ML, an implementation of an interactive theorem prover for Kleene algebra with tests (KAT). The system is designed to reflect the natural style of reasoning with K...
Kamal Aboul-Hosn, Dexter Kozen
CORR
2002
Springer
180views Education» more  CORR 2002»
13 years 8 months ago
Non-negative sparse coding
Abstract. Non-negative sparse coding is a method for decomposing multivariate data into non-negative sparse components. In this paper we briefly describe the motivation behind this...
Patrik O. Hoyer
AI50
2006
14 years 14 days ago
Development Via Information Self-structuring of Sensorimotor Experience and Interaction
actvoid.se Abstract. We describe how current work in Artificial Intelligence is using rigorous tools from information theory, namely information distance and experience distance to...
Chrystopher L. Nehaniv, Naeem Assif Mirza, Lars Ol...
TREC
2007
13 years 10 months ago
Question Answering with LCC's CHAUCER-2 at TREC 2007
In TREC 2007, Language Computer Corporation explored how a new, semantically-rich framework for information retrieval could be used to boost the overall performance of the answer ...
Andrew Hickl, Kirk Roberts, Bryan Rink, Jeremy Ben...