1819 search results - page 177 / 364 » Computability and Representations of the Zero Set |
162
click to vote
WEBI
2001
Springer
15 years 11 months ago
2001
Springer
In the proposed data model for XML databases, an XML element is directly represented as a ground (variable-free) XML expression—a generalization of an XML element by incorporatio...
253
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, ...
162
click to vote
ICPR
2008
IEEE
16 years 28 days ago
2008
IEEE
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
168
click to vote
FOCS
1992
IEEE
15 years 10 months ago
1992
IEEE
We consider a variant of the traditional task of explicitly reconstructing algebraic functions from black box representations. In the traditional setting for such problems, one is ...
180
click to vote
ISVC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In this paper, we present a novel graph, sub-graph and supergraph based face representation which captures the facial shape changes and deformations caused due to pose ch...