Sciweavers

4074 search results - page 165 / 815
» Defining Computational Aesthetics
Sort
View
ARSCOM
2005
106views more  ARSCOM 2005»
13 years 10 months ago
Chromatic Equivalence of Generalized Ladder Graphs
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of these graphs to be chromatically equivalent is proven. In addition a formula for...
Stephen Guattery, Gary Haggard, Ronald C. Read
TNN
2008
90views more  TNN 2008»
13 years 10 months ago
Shared Feature Extraction for Nearest Neighbor Face Recognition
In this paper, we propose a new supervised linear feature extraction technique for multiclass classification problems that is specially suited to the nearest neighbor classifier (N...
David Masip, Jordi Vitrià
COMPUTER
2004
79views more  COMPUTER 2004»
13 years 10 months ago
Extending the Reach of Business Processes
partners are abstracted as Web services, we have introduced additional constructs to represent human users and define human interaction patterns. Each business process defined in o...
Dipanjan Chakraborty, Hui Lei
CORR
2004
Springer
97views Education» more  CORR 2004»
13 years 10 months ago
Quantum typing
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda-calculus for the QRAM model, following the work of P. Seling...
Benoît Valiron
DCG
2002
62views more  DCG 2002»
13 years 10 months ago
Degrees of Real Wronski Maps
We study the map which sends vectors of polynomials into their Wronski determinants. This defines a projection map of a Grassmann variety which we call a Wronski map. Our main res...
A. Eremenko, Andrei Gabrielov