Sciweavers

6833 search results - page 8 / 1367
» Some two-character sets
Sort
View
FUIN
2002
117views more  FUIN 2002»
13 years 7 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
DCC
2004
IEEE
14 years 7 months ago
Some Indecomposable t-Designs
The existence of large sets of 5-(14,6,3) designs is in doubt. There are five simple 5-(14,6,6) designs known in the literature. In this note, by the use of a computer program, we...
Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie
ICDM
2002
IEEE
111views Data Mining» more  ICDM 2002»
14 years 10 days ago
An Algebraic Approach to Data Mining: Some Examples
In this paper, we introduce an algebraic approach to the foundations of data mining. Our approach is based upon two algebras of functions de ned over a common state space X and a ...
Robert L. Grossman, Richard G. Larson
COMBINATORICS
2007
111views more  COMBINATORICS 2007»
13 years 7 months ago
Some Properties of Unitary Cayley Graphs
The unitary Cayley graph Xn has vertex set Zn = {0, 1, . . . , n−1}. Vertices a, b
Walter Klotz, Torsten Sander
CVPR
2012
IEEE
11 years 9 months ago
3D landmark model discovery from a registered set of organic shapes
We present a machine learning framework that automatically generates a model set of landmarks for some class of registered 3D objects: here we use human faces. The aim is to repla...
Clement Creusot, Nick Pears, Jim Austin