Sciweavers

522 search results - page 26 / 105
» On the Hardness of the Noncommutative Determinant
Sort
View
ECAI
2006
Springer
13 years 11 months ago
An Efficient Upper Approximation for Conditional Preference
The fundamental operation of dominance testing, i.e., determining if one alternative is preferred to another, is in general very hard for methods of reasoning with qualitative cond...
Nic Wilson
VISUAL
2000
Springer
13 years 11 months ago
Chinese Cursive Script Character Image Retrieval Based on an Integrated Probability Function
Abstract. Often in content-based image retrieval, a single image attribute may not have enough discriminative information for retrieval. On the other hand, when multiple features a...
Irwin King, Zhong Jin, David Yuk-Ming Chan
WSC
2008
13 years 10 months ago
An experimental study of an iterative simulation-optimization algorithm for production planning
It is well known from queueing and simulation models that cycle times in capacitated production systems increase nonlinearly with resource utilization, which poses considerable di...
Durmus Fatih Irdem, Necip Baris Kacar, Reha Uzsoy
AB
2008
Springer
13 years 10 months ago
The Geometry of the Neighbor-Joining Algorithm for Small Trees
In 2007, Eickmeyer et al. showed that the tree topologies outputted by the Neighbor-Joining (NJ) algorithm and the balanced minimum evolution (BME) method for phylogenetic reconstr...
Kord Eickmeyer, Ruriko Yoshida
COCO
2008
Springer
100views Algorithms» more  COCO 2008»
13 years 9 months ago
Detecting Rational Points on Hypersurfaces over Finite Fields
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
Swastik Kopparty, Sergey Yekhanin