Sciweavers

514 search results - page 23 / 103
» On the Structure of Valiant's Complexity Classes
Sort
View
ICCS
2007
Springer
14 years 15 days ago
Discovering Latent Structures: Experience with the CoIL Challenge 2000 Data Set
We present a case study to demonstrate the possibility of discovering complex and interesting latent structures using hierarchical latent class (HLC) models. A similar effort was m...
Nevin Lianwen Zhang
ICIP
2002
IEEE
14 years 10 months ago
Exploiting group structure to improve retrieval accuracy and speed in image databases
Most image retrieval systems perform a linear search over the database to find the closest match to a query. However, databases usually exhibit a natural grouping structure into c...
Nuno Vasconcelos
IJAC
2002
128views more  IJAC 2002»
13 years 8 months ago
Computational Complexity of Generators and Nongenerators in Algebra
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
Clifford Bergman, Giora Slutzki
MOC
1998
71views more  MOC 1998»
13 years 8 months ago
Factorizing complex symmetric matrices with positive definite real and imaginary parts
Complex symmetric matrices whose real and imaginary parts are positive definite are shown to have a growth factor bounded by 2 for LU factorization. This result adds to the classe...
Nicholas J. Higham
ECAL
2007
Springer
14 years 2 months ago
Spatial Embedding and Complexity: The Small-World Is Not Enough
The “order for free” exhibited by some classes of system has been exploited by natural selection in order to build systems capable of exhibiting complex behaviour. Here we expl...
Christopher L. Buckley, Seth Bullock