Sciweavers

3873 search results - page 378 / 775
» Neighbourhood Components Analysis
Sort
View
194
Voted
RE
2010
Springer
15 years 1 months ago
Dependability Arguments with Trusted Bases
An approach is suggested for arguing that a system is dependable. The key idea is to structure the system so that critical requirements are localized in small, reliable subsets of ...
Eunsuk Kang, Daniel Jackson
ORL
2011
15 years 1 months ago
Convex approximations to sparse PCA via Lagrangian duality
We derive a convex relaxation for cardinality constrained Principal Component Analysis (PCA) by using a simple representation of the L1 unit ball and standard Lagrangian duality. ...
Ronny Luss, Marc Teboulle
ASPLOS
2006
ACM
16 years 24 days ago
Temporal search: detecting hidden malware timebombs with virtual machines
Worms, viruses, and other malware can be ticking bombs counting down to a specific time, when they might, for example, delete files or download new instructions from a public we...
Jedidiah R. Crandall, Gary Wassermann, Daniela A. ...
TIP
2011
162views more  TIP 2011»
15 years 1 months ago
Kernel Maximum Autocorrelation Factor and Minimum Noise Fraction Transformations
—This paper introduces kernel versions of maximum autocorrelation factor (MAF) analysis and minimum noise fraction (MNF) analysis. The kernel versions are based upon a dual formu...
Allan Aasbjerg Nielsen
ICCV
2001
IEEE
16 years 8 months ago
Statistical Context Priming for Object Detection
There is general consensus that context can be a rich source of information about an object's identity, location and scale. However, the issue of how to formalize contextual ...
Antonio B. Torralba, Pawan Sinha