Sciweavers

21324 search results - page 582 / 4265
» Making the case for computing
Sort
View
215
Voted
TFCV
1994
15 years 8 months ago
Attentive Visual Motion Processing: Computations in the Log-Polar Plane
Attentive vision is characterized by selective sensing in space and time as well as selective processing with respect to a speci c task. Selection in space involves the splitting ...
Konstantinos Daniilidis
CORR
2010
Springer
99views Education» more  CORR 2010»
15 years 7 months ago
Locating phase transitions in computationally hard problems
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
B. Ashok, T. K. Patra
CORR
2008
Springer
82views Education» more  CORR 2008»
15 years 7 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard
EOR
2007
102views more  EOR 2007»
15 years 7 months ago
Sub-stochastic matrix analysis for bounds computation - Theoretical results
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
Serge Haddad, Patrice Moreaux
PPL
2006
93views more  PPL 2006»
15 years 7 months ago
Inherently Parallel Geometric Computations
A new computational paradigm is described which o ers the possibility of superlinear and sometimes unbounded speedup, when parallel computation is used. The computations involved ...
Selim G. Akl