Sciweavers

962 search results - page 15 / 193
» Some Reducibilities on Regular Sets
Sort
View
ACMACE
2006
ACM
14 years 1 months ago
Wireless home entertainment center: reducing last hop delays for real-time applications
Future digital entertainment services available to home users will share several characteristics: i) they will be deployed and delivered through the Internet, ii) a single media c...
Claudio E. Palazzi, Giovanni Pau, Marco Roccetti, ...
APAL
2006
64views more  APAL 2006»
13 years 7 months ago
What can be efficiently reduced to the Kolmogorov-random strings?
We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings R...
Eric Allender, Harry Buhrman, Michal Koucký
IRI
2007
IEEE
14 years 1 months ago
Reducing hard SAT instances to polynomial ones
This last decade, propositional reasoning and search has been one of the hottest topics of research in the A.I. community, as the Boolean framework has been recognized as a powerf...
Olivier Fourdrinoy, Éric Grégoire, B...
CSDA
2007
128views more  CSDA 2007»
13 years 7 months ago
Regularized linear and kernel redundancy analysis
Redundancy analysis (RA) is a versatile technique used to predict multivariate criterion variables from multivariate predictor variables. The reduced-rank feature of RA captures r...
Yoshio Takane, Heungsun Hwang
ISBI
2009
IEEE
14 years 2 months ago
Accelerating Regularized Iterative CT Reconstruction on Commodity Graphics Hardware (GPU)
Iterative reconstruction algorithms augmented with regularization can produce high-quality reconstructions from few views and even in the presence of significant noise. In this pa...
Wei Xu, Klaus Mueller