1081 search results - page 28 / 217 » Working with the LR Degrees |
151
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
Every Boolean function on n variables can be expressed as a unique multivariate polynomial modulo p for every prime p. In this work, we study how the degree of a function in one c...
145
click to vote
KDD
2000
ACM
15 years 9 months ago
2000
ACM
Existing data cleaning methods work on the basis of computing the degree of similarity between nearby records in a sorted database. High recall is achieved by accepting records wi...
153
click to vote
INTERACT
2003
15 years 7 months ago
2003
: In 1998 the Stan Ackermans Institute at the Technical University Eindhoven (TU/e), the Netherlands, founded the User System Interaction (USI) Design Program. This program is a tw...
144
click to vote
APAL
2005
15 years 6 months ago
2005
Abstract. We prove that a finitely generated group is context-free whenever its Cayleygraph has a decidable monadic second-order theory. Hence, by the seminal work of Muller and Sc...
161
click to vote
JCT
2007
15 years 6 months ago
2007
Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. D.R. Woodall has shown that, if G is a plane triangulation, then the only zeros of P(G,t) in (−∞...