Sciweavers

552 search results - page 61 / 111
» On the Complexity of Join Predicates
Sort
View
EACL
2006
ACL Anthology
13 years 9 months ago
Making Tree Kernels Practical for Natural Language Learning
In recent years tree kernels have been proposed for the automatic learning of natural language applications. Unfortunately, they show (a) an inherent super linear complexity and (...
Alessandro Moschitti
DAGSTUHL
1997
13 years 9 months ago
InVIS - Interactive Visualization of Medical Data Sets
Interactive rendering of large data sets requires fast algorithms and rapid hardware acceleration. Both can be improved, but none of this ensures interactive response times. If a ...
Jörg Meyer, Steffen Gelder, Timna E. Schneide...
ECCC
2000
113views more  ECCC 2000»
13 years 7 months ago
Candidate One-Way Functions Based on Expander Graphs
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
Oded Goldreich
JSS
2010
215views more  JSS 2010»
13 years 6 months ago
Analyzing architectural styles
The backbone of many software architectures and component integration frameworks is an architectural style that provides a domain-specific design vocabulary and a set of constrai...
Jung Soo Kim, David Garlan
FAST
2009
13 years 5 months ago
Scalable Access Controls for Lineage
Lineage stores often contain sensitive information that needs protection from unauthorized access. We build on prior work for security and privacy of lineage information, focusing...
Arnon Rosenthal, Len Seligman, Adriane Chapman, Ba...