11740 search results - page 2005 / 2348 » More Problems in Rewriting |
197
click to vote
ASIACRYPT
2007
Springer
16 years 1 months ago
2007
Springer
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
198
click to vote
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
186
click to vote
CAIP
2007
Springer
16 years 1 months ago
2007
Springer
The paper focusses on a group of segmentation problems dealing with 3D data sets showing thin objects that appear disconnected in the data due to partial volume effects or a large...
179
click to vote
CIKM
2007
Springer
16 years 1 months ago
2007
Springer
The rapid growth of available data arises the need for more sophisticated techniques for semantic access to information. It has been proved that using conceptual model or ontology...
194
click to vote
DIS
2007
Springer
16 years 1 months ago
2007
Springer
We describe a technique for comparing distributions without the need for density estimation as an intermediate step. Our approach relies on mapping the distributions into a reprodu...