Sciweavers

302 search results - page 55 / 61
» Semi-local string comparison: algorithmic techniques and app...
Sort
View
AAAI
1994
14 years 11 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
BROADNETS
2004
IEEE
15 years 1 months ago
Capacity-Efficient Protection with Fast Recovery in Optically Transparent Mesh Networks
Survivability becomes increasingly critical in managing high-speed networks as data traffic continues to grow in both size and importance. In addition, the impact of failures is e...
Sun-il Kim, Steven S. Lumetta
BMCBI
2008
133views more  BMCBI 2008»
14 years 10 months ago
A Web-based and Grid-enabled dChip version for the analysis of large sets of gene expression data
Background: Microarray techniques are one of the main methods used to investigate thousands of gene expression profiles for enlightening complex biological processes responsible f...
Luca Corradi, Marco Fato, Ivan Porro, Silvia Scagl...
IVS
2008
121views more  IVS 2008»
14 years 9 months ago
Using treemaps for variable selection in spatio-temporal visualisation
We demonstrate and reflect upon the use of enhanced treemaps that incorporate spatial and temporal ordering for exploring a large multivariate spatio-temporal data set. The result...
Aidan Slingsby, Jason Dykes, Jo Wood
ICPR
2004
IEEE
15 years 11 months ago
Recognition of Expression Variant Faces Using Weighted Subspaces
In the past decade or so, subspace methods have been largely used in face recognition ? generally with quite success. Subspace approaches, however, generally assume the training d...
Aleix M. Martínez, Yongbin Zhang