Sciweavers

5022 search results - page 129 / 1005
» Data structures and problem solving using Java
Sort
View
AAAI
1990
14 years 11 months ago
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Ramin Zabih
BMCBI
2006
203views more  BMCBI 2006»
14 years 10 months ago
Independent component analysis reveals new and biologically significant structures in micro array data
Background: An alternative to standard approaches to uncover biologically meaningful structures in micro array data is to treat the data as a blind source separation (BSS) problem...
Attila Frigyesi, Srinivas Veerla, David Lindgren, ...
ICML
2009
IEEE
15 years 10 months ago
Learning with structured sparsity
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
Junzhou Huang, Tong Zhang, Dimitris N. Metaxas
CSC
2006
14 years 11 months ago
Applying Sparse Matrix Solvers to a Glacial Ice Sheet Model
- Two software packages for solving sparse systems of linear equations, SuperLU and UMFPACK, have been integrated with the University of Maine Ice Sheet Model for predicting the fo...
Rodney Jacobs, James Fastook, Aitbala Sargent
WABI
2007
Springer
15 years 4 months ago
Topology Independent Protein Structural Alignment
Abstract. Protein structural alignment is an indispensable tool used for many different studies in bioinformatics. Most structural alignment algorithms assume that the structural ...
Joe Dundas, T. Andrew Binkowski, Bhaskar DasGupta,...