Sciweavers

570 search results - page 68 / 114
» On the number of zero-sum subsequences
Sort
View
COMBINATORICS
2006
121views more  COMBINATORICS 2006»
13 years 10 months ago
Permutation Reconstruction from Minors
We consider the problem of permutation reconstruction, which is a variant of graph reconstruction. Given a permutation p of length n, we delete k of its entries in each possible w...
Mariana Raykova
ECCC
2007
144views more  ECCC 2007»
13 years 10 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III
ML
2008
ACM
156views Machine Learning» more  ML 2008»
13 years 10 months ago
On the connection between the phase transition of the covering test and the learning success rate in ILP
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
Érick Alphonse, Aomar Osmani
PAMI
2006
111views more  PAMI 2006»
13 years 9 months ago
Determination of the Method of Construction of 1650 B.C. Wall Paintings
In this paper, a methodology of general applicability is presented for answering the question if an artist used a number of archetypes to draw a painting or if he drew it freehand....
Constantin Papaodysseus, Dimitrios K. Fragoulis, M...
INFORMATICALT
2007
71views more  INFORMATICALT 2007»
13 years 9 months ago
Multiple Shift Scheduling of Hierarchical Workforce with Multiple Work Centers
This paper is concerned with an employee scheduling problem involving multiple shifts and work centers, where employees belong to a hierarchy of categories having downward substitu...
Salem M. Al-Yakoob, Hanif D. Sherali