Sciweavers

892 search results - page 49 / 179
» Calculating with Requirements
Sort
View
MP
2002
176views more  MP 2002»
15 years 12 days ago
UOBYQA: unconstrained optimization by quadratic approximation
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...
M. J. D. Powell
104
Voted
ISM
2006
IEEE
86views Multimedia» more  ISM 2006»
15 years 6 months ago
CoINS: Context Sensitive Indoor Navigation System
The Context sensitive Indoor Navigation System (CoINS) implements an architecture to develop context-aware indoor user guidance services and applications. This paper presents a de...
Fernando Lyardet, Jan Grimmer, Max Mühlhä...
104
Voted
IWVF
2001
Springer
15 years 5 months ago
Computational Surface Flattening: A Voxel-Based Approach
ÐA voxel-based method for flattening a surface in 3D space into 2D while best preserving distances is presented. Triangulation or polyhedral approximation of the voxel data are no...
Ruth Grossmann, Nahum Kiryati, Ron Kimmel
71
Voted
ICIP
2010
IEEE
14 years 10 months ago
Learning simple texture discrimination filters
Current texture analysis methods enable good discrimination but are computationally too expensive for applications which require high frame rates. This occurs because they use red...
Rui F. C. Guerreiro, Pedro M. Q. Aguiar
126
Voted
CVPR
2007
IEEE
16 years 2 months ago
What makes a good model of natural images?
Many low-level vision algorithms assume a prior probability over images, and there has been great interest in trying to learn this prior from examples. Since images are very non G...
Yair Weiss, William T. Freeman