Sciweavers

1086 search results - page 170 / 218
» Knowledge-based part correspondence
Sort
View
JSAC
2006
157views more  JSAC 2006»
13 years 8 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
PAMI
2006
230views more  PAMI 2006»
13 years 8 months ago
Shape Registration in Implicit Spaces Using Information Theory and Free Form Deformations
We present a novel variational and statistical approach for shape registration. Shapes of interest are implicitly embedded in a higher dimensional space of distance transforms. In...
Xiaolei Huang, Nikos Paragios, Dimitris N. Metaxas
AROBOTS
2005
93views more  AROBOTS 2005»
13 years 8 months ago
A Simple Robotic System for Neurorehabilitation
In the recent past, several researchers have shown that important variables in relearning motor skills and in changing the underlying neural architecture after stroke are the quant...
Silvestro Micera, Maria Chiara Carrozza, Eugenio G...
JMIV
2007
92views more  JMIV 2007»
13 years 8 months ago
Uniquely-Determined Thinning of the Tie-Zone Watershed Based on Label Frequency
There are many watershed transform algorithms in literature but most of them do not exactly correspond to their respective definition. The solution given by such algorithms depend...
Romaric Audigier, Roberto de Alencar Lotufo
IOR
2002
135views more  IOR 2002»
13 years 8 months ago
A Fluid Heuristic for Minimizing Makespan in Job Shops
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
J. G. Dai, Gideon Weiss