Sciweavers

6045 search results - page 246 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
CVPR
2007
IEEE
14 years 10 months ago
Feature Extraction by Maximizing the Average Neighborhood Margin
A novel algorithm called Average Neighborhood Margin Maximization (ANMM) is proposed for supervised linear feature extraction. For each data point, ANMM aims at pulling the neighb...
Fei Wang, Changshui Zhang
DAC
2003
ACM
14 years 9 months ago
Partial task assignment of task graphs under heterogeneous resource constraints
This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...
Radoslaw Szymanek, Krzysztof Kuchcinski
CLUSTER
2007
IEEE
14 years 2 months ago
Satisfying your dependencies with SuperMatrix
— SuperMatrix out-of-order scheduling leverages el abstractions and straightforward data dependency analysis to provide a general-purpose mechanism for obtaining parallelism from...
Ernie Chan, Field G. Van Zee, Enrique S. Quintana-...
SSD
2005
Springer
188views Database» more  SSD 2005»
14 years 1 months ago
Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results
Abstract. Evacuation planning is critical for numerous important applications, e.g. disaster emergency management and homeland defense preparation. Efficient tools are needed to pr...
Qingsong Lu, Betsy George, Shashi Shekhar
IPPS
2002
IEEE
14 years 1 months ago
A High Performance Algorithm for Incompressible Flows Using Local Solenoidal Functions
The convergence of iterative methods used to solve the linear systems arising in incompressible flow problems is sensitive to flow parameters such as the Reynolds number, time s...
Sreekanth R. Sambavaram, Vivek Sarin