3108 search results - page 528 / 622 » The Elements of Computer Credibility |
158
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
178
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
In this paper we show that the (co)chain complex associated with a decomposition of the computational domain, commonly called a mesh in computational science and engineering, can b...
184
click to vote
ICSOC
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. The collaborative creation of value is the central tenet of services science. In particular, then, the quality of a service encounter would depend on the mutual expectati...
178
click to vote
ICPR
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--Boosting covariance data on Riemannian manifolds has proven to be a convenient strategy in a pedestrian detection context. In this paper we show that the detection perfor...
167
Voted
CGF
2011
14 years 8 months ago
2011
The complexity and detail of geometric scenes that are used in today’s computer animated films and interactive games have reached a level where the manual creation by tradition...