1679 search results - page 25 / 336 » Pointcuts as Functional Queries |
120
Voted
ECCC
2010
14 years 11 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
115
Voted
SIGMOD
2004
ACM
16 years 24 days ago
2004
ACM
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
ICADL
2005
Springer
15 years 6 months ago
2005
Springer
Search engines of main-stream literature digital libraries such as ACM Digital Library, Google Scholar, and PubMed employ file-based systems, and provide users with a basic boolean...
116
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
123
click to vote
COLT
2001
Springer
15 years 5 months ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...