16883 search results - page 376 / 3377 » Generalized Non-Reducible Descriptors |
156
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
180
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
280
click to vote
ITICSE
2009
ACM
16 years 1 months ago
2009
ACM
This paper describes our experiences with the first partial deployment of Presentations Automatically Organized from Lectures (PAOL), a lecture recording system developed and tes...
155
click to vote
ITICSE
2009
ACM
16 years 1 months ago
2009
ACM
In general, university guidelines or policies on plagiarism are not sufficiently detailed to cope with the technical complexity of software. Software plagiarism can have a signi...
147
click to vote
SIGECOM
2009
ACM
16 years 1 months ago
2009
ACM
Motivated by the prevalence of online questionnaires in electronic commerce, and of multiple-choice questions in such questionnaires, we consider the problem of eliciting truthful...