Sciweavers

1396 search results - page 32 / 280
» aim 2006
Sort
View
FUIN
2002
117views more  FUIN 2002»
14 years 9 months ago
A Comparative Study of Some Generalized Rough Approximations
In this paper we focus upon a comparison of some generalized rough approximations of sets, where the classical indiscernibility relation is generalized to any binary reflexive rela...
Anna Gomolinska
IJPRAI
2002
117views more  IJPRAI 2002»
14 years 9 months ago
Analysis and Comparison of Eigenspace-Based Face Recognition Approaches
Different eigenspace-based approaches have been proposed for the recognition of faces. They differ mostly in the kind of projection method been used and in the similarity matching ...
Pablo Navarrete, Javier Ruiz-del-Solar
JANCL
2002
77views more  JANCL 2002»
14 years 9 months ago
Axiomatizing Distance Logics
In [8, 6] we introduced a family of `modal' languages intended for talking about distances. These languages are interpreted in `distance spaces' which satisfy some (or a...
Oliver Kutz, Holger Sturm, Nobu-Yuki Suzuki, Frank...
JFP
2002
89views more  JFP 2002»
14 years 9 months ago
The countdown problem
We systematically develop a functional program that solves the countdown problem, a numbers game in which the aim is to construct arithmetic expressions satisfying certain constra...
Graham Hutton
JCT
2010
65views more  JCT 2010»
14 years 8 months ago
Multiple cross-intersecting families of signed sets
A k-signed r-set on [n] = {1, ..., n} is an ordered pair (A, f), where A is an rsubset of [n] and f is a function from A to [k]. Families A1, ..., Ap are said to be cross-intersec...
Peter Borg, Imre Leader