537 search results - page 32 / 108 » Problems from CGCS Luminy, May 2007 |
141
click to vote
COLT
2007
Springer
16 years 13 hour ago
2007
Springer
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
150
click to vote
DATAMINE
2007
15 years 5 months ago
2007
This paper discusses a new application of data mining, quantifying the importance of responding to trigger events with reactive contacts. Trigger events happen during a customer’...
161
click to vote
ESWA
2007
15 years 5 months ago
2007
The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors su...
207
click to vote
PAMI
2007
15 years 5 months ago
2007
— Digitization is not as easy as it looks. If one digitizes a 3D object even with a dense sampling grid, the reconstructed digital object may have topological distortions and in ...
192
click to vote
ECCC
2010
15 years 4 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...