Sciweavers

257 search results - page 4 / 52
» On the Complexity of Computing Units in a Number Field
Sort
View
ICCV
2005
IEEE
14 years 9 months ago
Fixed Point Probability Field for Complex Occlusion Handling
In this paper, we show that in a multi-camera context, we can effectively handle occlusions in real-time at each frame independently, even when the only available data comes from ...
François Fleuret, Pascal Fua, Richard Lenga...
ARCS
2004
Springer
14 years 26 days ago
A Framework for Dependability Evaluation of Mechatronic Units
: Mechatronic units are characterized by a complex interaction of functions from mechanics, electronics, communication and computer systems. These different fields of technology as...
Hans-Dieter Kochs, Jörg Petersen
DAGSTUHL
2006
13 years 8 months ago
Approaches to Compute Workflow Complexity
-- During the last 20 years, complexity has been an interesting topic that has been investigated in many fields of science, such as biology, neurology, software engineering, chemis...
Jorge Cardoso
VIS
2003
IEEE
234views Visualization» more  VIS 2003»
14 years 8 months ago
Saddle Connectors - An Approach to Visualizing the Topological Skeleton of Complex 3D Vector Fields
One of the reasons that topological methods have a limited popularity for the visualization of complex 3D flow fields is the fact that such topological structures contain a number...
Hans-Christian Hege, Hans-Peter Seidel, Holger The...
AFRICACRYPT
2010
Springer
14 years 2 months ago
Avoiding Full Extension Field Arithmetic in Pairing Computations
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...
Craig Costello, Colin Boyd, Juan Manuel Gonz&aacut...