Sciweavers

1603 search results - page 208 / 321
» Universal Confidence Sets for Solutions of Optimization Prob...
Sort
View
FOCS
1992
IEEE
15 years 10 months ago
Efficient Inference of Partial Types
Partial types for the -calculus were introduced by Thatte in 1988 [3] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persiste...
Dexter Kozen, Jens Palsberg, Michael I. Schwartzba...
IADIS
2004
15 years 7 months ago
Using SPKI/SDSI for Distributed Maintenance of Attribute Release Policies in Shibboleth
The Shibboleth middleware from Internet2 provides a way for users at higher-education institutions to access remote electronic content in compliance with the inter-institutional l...
Sidharth Nazareth, Sean W. Smith
CONCUR
2010
Springer
15 years 6 months ago
On the Compositionality of Round Abstraction
ompositionality of Round Abstraction Abstract Dan R. Ghica and Mohamed N. Menaa University of Birmingham, U.K. We revisit a technique called round abstraction as a solution to the ...
Dan R. Ghica, Mohamed N. Menaa
GLVLSI
2009
IEEE
125views VLSI» more  GLVLSI 2009»
16 years 1 months ago
Timing-driven N-way decomposition
Logic decomposition has been extensively used to optimize the worst-case delay and the area in the technology independent phase. Bi-decomposition is one of the state-of-art techni...
David Bañeres, Jordi Cortadella, Michael Ki...
CVPR
2008
IEEE
16 years 28 days ago
Fast kernel learning for spatial pyramid matching
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
Junfeng He, Shih-Fu Chang, Lexing Xie