Sciweavers

379 search results - page 11 / 76
» Strong reducibility of partial numberings
Sort
View
ESSMAC
2003
Springer
14 years 26 days ago
Analysis of Some Methods for Reduced Rank Gaussian Process Regression
Abstract. While there is strong motivation for using Gaussian Processes (GPs) due to their excellent performance in regression and classification problems, their computational com...
Joaquin Quiñonero Candela, Carl Edward Rasm...
EDBT
2010
ACM
155views Database» more  EDBT 2010»
14 years 2 months ago
Reducing metadata complexity for faster table summarization
Since the visualization real estate puts stringent constraints on how much data can be presented to the users at once, table summarization is an essential tool in helping users qu...
K. Selçuk Candan, Mario Cataldi, Maria Luis...
CCS
2008
ACM
13 years 9 months ago
Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...
Ralf Küsters, Tomasz Truderung
TCSV
2002
94views more  TCSV 2002»
13 years 7 months ago
Drift compensation for reduced spatial resolution transcoding
This paper discusses the problem of reduced-resolution transcoding of compressed video bitstreams. An analysis of drift errors is provided to identify the sources of quality degra...
Peng Yin, Anthony Vetro, Bede Liu, Huifang Sun
CGO
2003
IEEE
13 years 11 months ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue