6315 search results - page 881 / 1263 » Approximating Solution Structure |
155
click to vote
ECSQARU
2009
Springer
15 years 11 months ago
2009
Springer
We consider the problem of inference from multinomial data with chances θ, subject to the a-priori information that the true parameter vector θ belongs to a known convex polytope...
182
click to vote
EVOW
2009
Springer
15 years 11 months ago
2009
Springer
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
170
click to vote
ICANN
2009
Springer
15 years 10 months ago
2009
Springer
Neural networks and other sophisticated machine learning algorithms frequently miss simple solutions that can be discovered by a more constrained learning methods. Transition from ...
162
click to vote
IWANN
2001
Springer
15 years 10 months ago
2001
Springer
This paper proposes the general paradigm to build Q'tron neural networks (NNs) for visual cryptography. Given a visual encryption scheme, usually described using an access st...
127
Voted
CIKM
2000
Springer
15 years 10 months ago
2000
Springer
The challenge of automatically summarising Web pages and sites is a great one. However, currently there is no solution which offers an easy way to produce unbiased, coherent , and...