Sciweavers

5109 search results - page 38 / 1022
» On Learning Limiting Programs
Sort
View
SIGMOD
2006
ACM
117views Database» more  SIGMOD 2006»
14 years 10 months ago
Database support for matching: limitations and opportunities
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
Ameet Kini, Srinath Shankar, Jeffrey F. Naughton, ...
DSN
2007
IEEE
14 years 4 months ago
Architecture-Level Soft Error Analysis: Examining the Limits of Common Assumptions
This paper concerns the validity of a widely used method for estimating the architecture-level mean time to failure (MTTF) due to soft errors. The method first calculates the fai...
Xiaodong Li, Sarita V. Adve, Pradip Bose, Jude A. ...
IEEEPACT
2000
IEEE
14 years 2 months ago
Exploring the Limits of Sub-Word Level Parallelism
Multimedia instruction set extensions have become a prominent feature in desktop microprocessor platforms, promising superior performance on a wide range of floating-point and int...
Kevin Scott, Jack W. Davidson
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 10 months ago
Efficient Clustering with Limited Distance Information
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
ICPP
2008
IEEE
14 years 4 months ago
Parallelization and Characterization of Probabilistic Latent Semantic Analysis
Probabilistic Latent Semantic Analysis (PLSA) is one of the most popular statistical techniques for the analysis of two-model and co-occurrence data. It has applications in inform...
Chuntao Hong, Wenguang Chen, Weimin Zheng, Jiulong...