Sciweavers

1236 search results - page 133 / 248
» Efficient Interpretation Policies
Sort
View
ICDT
2009
ACM
129views Database» more  ICDT 2009»
14 years 10 months ago
Faster join-projects and sparse matrix multiplications
Computing an equi-join followed by a duplicate eliminating projection is conventionally done by performing the two operations in serial. If some join attribute is projected away t...
Rasmus Resen Amossen, Rasmus Pagh
WWW
2007
ACM
14 years 10 months ago
SRing: a structured non dht p2p overlay supporting string range queries
This paper presents SRing, a structured non DHT P2P overlay that efficiently supports exact and range queries on multiple attribute values. In SRing, all attribute values are inte...
Xiaoping Sun, Xue Chen
EACL
2009
ACL Anthology
14 years 10 months ago
Using Lexical and Relational Similarity to Classify Semantic Relations
Many methods are available for computing semantic similarity between individual words, but certain NLP tasks require the comparison of word pairs. This paper presents a kernel-bas...
Ann A. Copestake, Diarmuid Ó Séaghdh...
ICFP
2007
ACM
14 years 10 months ago
Lazy call-by-value evaluation
Designing debugging tools for lazy functional programming languages is a complex task which is often solved by expensive tracing of lazy computations. We present a new approach in...
Bernd Braßel, Frank Huch, Germán Vida...
DCC
2007
IEEE
14 years 9 months ago
Quantization of Sparse Representations
Compressive sensing (CS) is a new signal acquisition technique for sparse and compressible signals. Rather than uniformly sampling the signal, CS computes inner products with rand...
Petros Boufounos, Richard G. Baraniuk