Sciweavers

12194 search results - page 2015 / 2439
» Numberings Optimal for Learning
Sort
View
ASIACRYPT
2011
Springer
14 years 7 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer
ICALP
2009
Springer
16 years 8 months ago
Counting Subgraphs via Homomorphisms
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...
Omid Amini, Fedor V. Fomin, Saket Saurabh
ICDE
2008
IEEE
2751views Database» more  ICDE 2008»
17 years 7 months ago
Skyline Query Processing for Incomplete Data
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 ...
CVPR
2009
IEEE
17 years 2 months ago
In Defense of Orthonormality Constraints for Nonrigid Structure from Motion
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...
Ijaz Akhter (LUMS, Lahore, Pakistan), Yaser Sheikh...
CVPR
2009
IEEE
17 years 2 months ago
Visibility Constraints on Features of 3D Objects
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...
« Prev « First page 2015 / 2439 Last » Next »