Sciweavers

3116 search results - page 235 / 624
» Recovering
Sort
View
FOCS
1995
IEEE
15 years 4 months ago
Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract)
d Abstract) Noga Alon ∗ Jeff Edmonds † Michael Luby ‡ An (n, c, , r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. ...
Noga Alon, Jeff Edmonds, Michael Luby
HICSS
1995
IEEE
110views Biometrics» more  HICSS 1995»
15 years 4 months ago
Reliability analysis of CSP specifications using Petri nets and Markov processes
In our research we are developing methodologiesand tools to permit stochastic analyses of CSP-based system specifications. In this regard, we have been developing morphismsbetween...
Krishna M. Kavi, Frederick T. Sheldon, Behrooz Shi...
ICCV
1995
IEEE
15 years 4 months ago
Adaptive Shape Evolution Using Blending
We propose a shape representation scheme which allows two shapes to be combined into a single model. The desired regions of the two shapes are selected, and then merged together f...
Douglas DeCarlo, Dimitris N. Metaxas
88
Voted
ICRA
1995
IEEE
125views Robotics» more  ICRA 1995»
15 years 4 months ago
Inductive Generation of Diagnostic Knowledge for Autonomous Assembly
A generic architecture for evolutive supervision of robotized assembly tasks is presented. This architecture , at different levels of abstraction, functions for dispatching action...
Luís Seabra Lopes, Luis M. Camarinha-Matos
82
Voted
ECCV
2010
Springer
15 years 4 months ago
Contour Grouping and Abstraction using Simple Part Models
Grouping and Abstraction Using Simple Part Models Pablo Sala and Sven Dickinson Department of Computer Science, University of Toronto, Toronto ON, Canada We address the problem of ...