2774 search results - page 268 / 555 » Exploiting Deep Structure |
193
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Abstract. Extracting information from very large collections of structured, semistructured or even unstructured data can be a considerable challenge when much of the hidden informa...
178
click to vote
HPCA
2004
IEEE
16 years 7 months ago
2004
IEEE
Many current programmable architectures designed to exploit data parallelism require computation to be structured to operate on sequentially accessed vectors or streams of data. A...
173
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
171
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
: This work describes a method for processing XPath on a relational back-end that significantly limits the number of SQL joins required, takes advantage of the strengths of modern ...
158
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
In this paper we study the neighbourhood of 15-variable Patterson-Wiedemann (PW) functions, i.e., the functions that differ by a small Hamming distance from the PW functions in te...