1213 search results - page 3 / 243 » Approximation in quantale-enriched categories |
JUCS
2007
13 years 6 months ago
2007
: An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the poly...
ECIR
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In this paper we show how approximate matrix factorisations can be used to organise document summaries returned by a search engine into meaningful thematic categories. We...
ENTCS
2008
13 years 6 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
CHI
2002
ACM
14 years 7 months ago
2002
ACM
We present experimental results showing that search for target items in a three-tiered categorization structure (approximately 8 links per page) is faster than a comparable two-ti...
CGF
2005
13 years 6 months ago
2005
Aiming at robust surface structure recovery, we extend the powerful optimization technique of variational shape approximation by allowing for several different primitives to repre...