Sciweavers

424 search results - page 53 / 85
» Realizability models and implicit complexity
Sort
View
PAKDD
2007
ACM
152views Data Mining» more  PAKDD 2007»
14 years 2 months ago
Spectral Clustering Based Null Space Linear Discriminant Analysis (SNLDA)
While null space based linear discriminant analysis (NLDA) obtains a good discriminant performance, the ability easily suffers from an implicit assumption of Gaussian model with sa...
Wenxin Yang, Junping Zhang
SIGGRAPH
2003
ACM
14 years 1 months ago
TensorTextures
This paper introduces a tensor framework for image-based rendering. In particular, we develop an algorithm called TensorTextures that learns a parsimonious model of the bidirectio...
M. Alex O. Vasilescu, Demetri Terzopoulos
EUROPAR
1999
Springer
14 years 28 days ago
DAOS - Scalable And-Or Parallelism
Abstract. This paper presents DAOS, a model for exploitation of Andand Or-parallelism in logic programs. DAOS assumes a physically distributed memory environment and a logically sh...
Luís Fernando Castro, Vítor Santos C...
DLOG
2009
13 years 6 months ago
Reasoning About Typicality in ALC and EL
In this work we summarize our recent results on extending Description Logics for reasoning about prototypical properties and inheritance with exceptions. First, we focus our attent...
Laura Giordano, Valentina Gliozzi, Nicola Olivetti...
CHI
2003
ACM
14 years 9 months ago
The digital set-top box as a virtual channel provider
This research is based on the realization that the desktop computing paradigm is not appropriate for television, because it is adapted to fundamentally different user aspirations ...
Konstantinos Chorianopoulos