Sciweavers

4128 search results - page 658 / 826
» Learning and using relational theories
Sort
View
STOC
2009
ACM
152views Algorithms» more  STOC 2009»
15 years 5 months ago
Green's conjecture and testing linear-invariant properties
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
Asaf Shapira
ECIR
2007
Springer
14 years 11 months ago
Combining Evidence for Relevance Criteria: A Framework and Experiments in Web Retrieval
Abstract. We present a framework that assesses relevance with respect to several relevance criteria, by combining the query-dependent and query-independent evidence indicating thes...
Theodora Tsikrika, Mounia Lalmas
AI
2008
Springer
14 years 10 months ago
Modelling and solving temporal reasoning as propositional satisfiability
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
Duc Nghia Pham, John Thornton, Abdul Sattar
LOGCOM
2008
94views more  LOGCOM 2008»
14 years 10 months ago
Preservation of Interpolation Features by Fibring
Fibring is a metalogical constructor that permits to combine different logics by operating on their deductive systems under certain natural restrictions, as for example that the t...
Walter Alexandre Carnielli, João Rasga, Cri...
JCT
2007
140views more  JCT 2007»
14 years 10 months ago
Homomorphisms and edge-colourings of planar graphs
We conjecture that every planar graph of odd-girth 2k + 1 admits a homomorphism to Cayley graph C(Z2k+1 2 , S2k+1), with S2k+1 being the set of (2k + 1)vectors with exactly two co...
Reza Naserasr