A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Recently, there has been much interest in processing skyline queries for various applications that include decision making, personalized services, and search pruning. Skyline queri...
Justin J. Levandoski, Mohamed E. Khalefa, Mohamed ...
In factorization approaches to nonrigid structure from
motion, the 3D shape of a deforming object is usually modeled
as a linear combination of a small number of basis
shapes. T...
To recognize three-dimensional objects it is important to
model how their appearances can change due to changes
in viewpoint. A key aspect of this involves understanding
which o...
Ronen Basri, Pedro F. Felzenszwalb, Ross B. Girshi...