Sciweavers

1523 search results - page 87 / 305
» The Computational Complexity of Linear Optics
Sort
View
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
13 years 9 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo
JMM2
2007
113views more  JMM2 2007»
13 years 8 months ago
Shape Morphing of Complex Geometries Using Partial Differential Equations
— An alternative technique for shape morphing using a surface generating method using partial differential equations is outlined throughout this work. The boundaryvalue nature th...
Gabriela González Castro, Hassan Ugail
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 6 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
SMA
2010
ACM
171views Solid Modeling» more  SMA 2010»
13 years 9 months ago
Efficient simplex computation for fixture layout design
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
Yu Zheng, Ming C. Lin, Dinesh Manocha
ICML
2007
IEEE
14 years 9 months ago
Efficiently computing minimax expected-size confidence regions
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...
Brent Bryan, H. Brendan McMahan, Chad M. Schafer, ...