Sciweavers

258 search results - page 27 / 52
» Some Notes on Fine Computability
Sort
View
AI
2005
Springer
14 years 9 months ago
The complexity of contract negotiation
The use of software agents for automatic contract negotiation in e-commerce and e-trading ents has been the subject of considerable recent interest. A widely studied abstract mode...
Paul E. Dunne, Michael Wooldridge, Michael Laurenc...
CGF
2002
155views more  CGF 2002»
14 years 9 months ago
Improved Scene Reconstruction from Range Images
The modeling of real scenes is a complex and challenging task for which the use of laser rangefinders is one of the most promising approaches. Unfortunately, in many situations, i...
Jianning Wang, Manuel M. Oliveira
MICS
2007
84views more  MICS 2007»
14 years 9 months ago
Pseudospectra of Matrix Polynomials that Are Expressed in Alternative Bases
Spectra and pseudospectra of matrix polynomials are of interest in geometric intersection problems, vibration problems, and analysis of dynamical systems. In this note we consider ...
Robert M. Corless, Nargol Rezvani, Amirhossein Ami...
PR
2007
139views more  PR 2007»
14 years 9 months ago
Learning the kernel matrix by maximizing a KFD-based class separability criterion
The advantage of a kernel method often depends critically on a proper choice of the kernel function. A promising approach is to learn the kernel from data automatically. In this p...
Dit-Yan Yeung, Hong Chang, Guang Dai
EJC
2008
14 years 9 months ago
Locally constrained graph homomorphisms and equitable partitions
We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent charact...
Jirí Fiala, Daniël Paulusma, Jan Arne ...