Sciweavers

9842 search results - page 1714 / 1969
» Problem complexity
Sort
View
IJCV
1998
153views more  IJCV 1998»
15 years 6 months ago
Rational Filters for Passive Depth from Defocus
A fundamental problem in depth from defocus is the measurement of relative defocus between images. The performance of previously proposed focus operators are inevitably sensitive t...
Masahiro Watanabe, Shree K. Nayar
COMCOM
1999
122views more  COMCOM 1999»
15 years 6 months ago
An accurate performance model of shared buffer ATM switches under hot spot traffic
Asynchronous transfer mode (ATM) switches based on shared buffering are known to have better performance and buffer utilization than input or output queued switches. Shared buffer...
Mahmoud Saleh, Mohammed Atiquzzaman
MISQ
2002
111views more  MISQ 2002»
15 years 6 months ago
A Design Theory for Systems That Support Emergent Knowledge Processes
This paper addresses the design problem of providing IT support for emerging knowledge processes (EKPs). EKPs are organizational activity patterns that exhibit three characteristi...
M. Lynne Markus, Ann Majchrzak, Les Gasser
MOC
1998
108views more  MOC 1998»
15 years 6 months ago
Numerical conformal mapping based on the generalised conjugation operator
Abstract. An iterative procedure for numerical conformal mapping is presented which imposes no restriction on the boundary complexity. The formulation involves two analytically equ...
Bao Cheng Li, Stavros Syngellakis
MOC
1998
92views more  MOC 1998»
15 years 6 months ago
Perturbing polynomials with all their roots on the unit circle
Given a monic real polynomial with all its roots on the unit circle, we ask to what extent one can perturb its middle coefficient and still have a polynomial with all its roots on ...
Michael J. Mossinghoff, Christopher G. Pinner, Jef...
« Prev « First page 1714 / 1969 Last » Next »