Sciweavers

425 search results - page 67 / 85
» Polynomial Time Data Reduction for Dominating Set
Sort
View
ICDM
2009
IEEE
109views Data Mining» more  ICDM 2009»
15 years 4 months ago
Finding Associations and Computing Similarity via Biased Pair Sampling
Sampling-based methods have previously been proposed for the problem of finding interesting associations in data, even for low-support items. While these methods do not guarantee ...
Andrea Campagna, Rasmus Pagh
LREC
2008
114views Education» more  LREC 2008»
14 years 11 months ago
Improving Statistical Machine Translation Efficiency by Triangulation
In current phrase-based Statistical Machine Translation systems, more training data is generally better than less. However, a larger data set eventually introduces a larger model ...
Yu Chen, Andreas Eisele, Martin Kay
122
Voted
HPCA
1996
IEEE
15 years 1 months ago
A Comparison of Entry Consistency and Lazy Release Consistency Implementations
This paper compares several implementations of entry consistency (EC) and lazy release consistency (LRC), two relaxed memory models in use with software distributed shared memory ...
Sarita V. Adve, Alan L. Cox, Sandhya Dwarkadas, Ra...
ECCV
2002
Springer
15 years 11 months ago
Assorted Pixels: Multi-sampled Imaging with Structural Models
Abstract. Multi-sampled imaging is a general framework for using pixels on an image detector to simultaneously sample multiple dimensions of imaging (space, time, spectrum, brightn...
Shree K. Nayar, Srinivasa G. Narasimhan
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
15 years 1 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...