Sciweavers

9209 search results - page 395 / 1842
» Data Space Randomization
Sort
View
ICML
2003
IEEE
16 years 7 months ago
Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, wit...
Xiaojin Zhu, Zoubin Ghahramani, John D. Lafferty
SODA
2010
ACM
409views Algorithms» more  SODA 2010»
16 years 4 months ago
Data Structures for Range Minimum Queries in Multidimensional Arrays
Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous subarray of A. The 1D RMQ problem has been studied int...
Hao Yuan, Mikhail J. Atallah
LREC
2008
114views Education» more  LREC 2008»
15 years 8 months ago
Simple-Clips ongoing research: more information with less data by implementing inheritance
This paper presents the application of inheritance to the formal taxonomy (is-a) of a semantically rich Lexical Resource (LR) based on the Generative Lexicon theory, SIMPLE-CLIPS....
Riccardo Del Gratta, Nilda Ruimy, Antonio Toral
APPROX
2011
Springer
234views Algorithms» more  APPROX 2011»
14 years 6 months ago
Streaming Algorithms with One-Sided Estimation
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
Joshua Brody, David P. Woodruff
ICDCS
2009
IEEE
16 years 4 months ago
A Practical Study of Regenerating Codes for Peer-to-Peer Backup Systems
In distributed storage systems, erasure codes represent an attractive solution to add redundancy to stored data while limiting the storage overhead. They are able to provide the s...
Alessandro Duminuco, Ernst W. Biersack