Sciweavers

1682 search results - page 296 / 337
» Variational Constraints in 3D
Sort
View
ICDE
2005
IEEE
120views Database» more  ICDE 2005»
14 years 9 months ago
Corpus-based Schema Matching
Schema Matching is the problem of identifying corresponding elements in different schemas. Discovering these correspondences or matches is inherently difficult to automate. Past s...
Jayant Madhavan, Philip A. Bernstein, AnHai Doan, ...
ICML
1999
IEEE
14 years 8 months ago
Detecting Motifs from Sequences
The problemofmultipleglobalcomparisonin familiesof biologicalsequences has been wellstudied. Fewer algorithms have been developed for identifying local consensus patterns or motif...
Yuh-Jyh Hu, Suzanne B. Sandmeyer, Dennis F. Kibler
ICCAD
2006
IEEE
124views Hardware» more  ICCAD 2006»
14 years 4 months ago
A linear-time approach for static timing analysis covering all process corners
Abstract—Manufacturing process variations lead to circuit timing variability and a corresponding timing yield loss. Traditional corner analysis consists of checking all process c...
Sari Onaissi, Farid N. Najm
DATE
2009
IEEE
89views Hardware» more  DATE 2009»
14 years 2 months ago
Robust non-preemptive hard real-time scheduling for clustered multicore platforms
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
Michele Lombardi, Michela Milano, Luca Benini
ICRA
2006
IEEE
149views Robotics» more  ICRA 2006»
14 years 1 months ago
On Learning the Statistical Representation of a Task and Generalizing it to Various Contexts
— This paper presents an architecture for solving generically the problem of extracting the constraints of a given task in a programming by demonstration framework and the problem...
Sylvain Calinon, Florent Guenter, Aude Billard