Sciweavers

3991 search results - page 626 / 799
» Bounding homogeneous models
Sort
View
VISUALIZATION
1999
IEEE
14 years 14 days ago
Efficient Compression of Non-Manifold Polygonal Meshes
We present a method for compressing non-manifold polygonal meshes, i.e., polygonal meshes with singularities, which occur very frequently in the real-world. Most efficient polygon...
André Guéziec, Frank Bossen, Gabriel...
ATAL
2007
Springer
14 years 6 days ago
Determining confidence when integrating contributions from multiple agents
Integrating contributions received from other agents is an essential activity in multi-agent systems (MASs). Not only must related contributions be integrated together, but the co...
Raphen Becker, Daniel D. Corkill
JCSS
2008
90views more  JCSS 2008»
13 years 8 months ago
Fault tolerance in cellular automata at high fault rates
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply ...
Mark McCann, Nicholas Pippenger
JMLR
2008
230views more  JMLR 2008»
13 years 8 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...
MP
2002
176views more  MP 2002»
13 years 7 months 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