Sciweavers

4158 search results - page 617 / 832
» A Framework for Web Science
Sort
View
195
Voted
AAAI
2011
14 years 6 months ago
Lossy Conservative Update (LCU) Sketch: Succinct Approximate Count Storage
In this paper, we propose a variant of the conservativeupdate Count-Min sketch to further reduce the overestimation error incurred. Inspired by ideas from lossy counting, we divid...
Amit Goyal, Hal Daumé III
EMNLP
2011
14 years 5 months ago
Approximate Scalable Bounded Space Sketch for Large Data NLP
We exploit sketch techniques, especially the Count-Min sketch, a memory, and time efficient framework which approximates the frequency of a word pair in the corpus without explic...
Amit Goyal, Hal Daumé III
CVPR
2009
IEEE
1599views Computer Vision» more  CVPR 2009»
17 years 1 months ago
Multi-Label Sparse Coding for Automatic Image Annotation
In this paper, we present a multi-label sparse coding framework for feature extraction and classification within the context of automatic image annotation. First, each image is ...
Changhu Wang (University of Science and Technology...
PKC
2009
Springer
164views Cryptology» more  PKC 2009»
16 years 6 months ago
Asynchronous Multiparty Computation: Theory and Implementation
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
Ivan Damgård, Jesper Buus Nielsen, Martin Ge...
POPL
2004
ACM
16 years 6 months ago
Asynchronous and deterministic objects
We present in this article a precise security model for data confidentiality in the framework of asynchronous and deterministic objects. Our underlying programming model is based ...
Denis Caromel, Ludovic Henrio, Bernard P. Serpette