Sciweavers

1984 search results - page 179 / 397
» The colourful feasibility problem
Sort
View
SCHEDULING
2008
112views more  SCHEDULING 2008»
15 years 6 months ago
Time-constrained project scheduling
We propose a new approach for scheduling with strict deadlines and apply this approach to the TimeConstrained Project Scheduling Problem (TCPSP). To be able to meet these deadlines...
T. A. Guldemond, Johann Hurink, Jacob Jan Paulus, ...
CVPR
2004
IEEE
16 years 8 months ago
Graphical Models for Graph Matching
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
Dante Augusto Couto Barone, Terry Caelli, Tib&eacu...
ICPR
2006
IEEE
16 years 7 months ago
Reconciling Landmarks and Level Sets
Shape warping is a key problem in statistical shape analysis. This paper proposes a framework for geometric shape warping based on both shape distances and landmarks. Our method i...
Olivier D. Faugeras, Pierre Maurel, Renaud Keriven
DAC
2001
ACM
16 years 7 months ago
Testing for Interconnect Crosstalk Defects Using On-Chip Embedded Processor Cores
Crosstalk effects degrade the integrity of signals traveling on long interconnects and must be addressed during manufacturing testing. External testing for crosstalk is expensive ...
Li Chen, Xiaoliang Bai, Sujit Dey
MICCAI
2005
Springer
16 years 7 months ago
Spatial Motion Constraints for Robot Assisted Suturing Using Virtual Fixtures
We address the problem of the stitching task in endoscopic surgery using a circular needle under robotic assistance. Our main focus is to present an algorithm for suturing using gu...
Ankur Kapoor, Ming Li, Russell H. Taylor