Sciweavers

11397 search results - page 2138 / 2280
» A Relational Abstraction for Functions
Sort
View
362
Voted
CASSIS
2005
Springer
16 years 17 days ago
The Architecture of a Privacy-Aware Access Control Decision Component
Today many interactions are carried out online through Web sites and e-services and often private and/or sensitive information is required by service providers. A growing concern r...
Claudio Agostino Ardagna, Marco Cremonini, Ernesto...
199
Voted
CCS
2005
ACM
16 years 17 days ago
Modeling insider attacks on group key-exchange protocols
Protocols for authenticated key exchange (AKE) allow parties within an insecure network to establish a common session key which can then be used to secure their future communicati...
Jonathan Katz, Ji Sun Shin
201
Voted
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
16 years 17 days ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
202
Voted
CVBIA
2005
Springer
16 years 17 days ago
Analyzing Anatomical Structures: Leveraging Multiple Sources of Knowledge
Analysis of medical images, especially the extraction of anatomical structures, is a critical component of many medical applications: surgical planning and navigation, and populati...
W. Eric L. Grimson, Polina Golland
FPGA
2005
ACM
215views FPGA» more  FPGA 2005»
16 years 17 days ago
Design, layout and verification of an FPGA using automated tools
Creating a new FPGA is a challenging undertaking because of the significant effort that must be spent on circuit design, layout and verification. It currently takes approximately ...
Ian Kuon, Aaron Egier, Jonathan Rose
« Prev « First page 2138 / 2280 Last » Next »