Sciweavers

424 search results - page 83 / 85
» Realizability models and implicit complexity
Sort
View
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
14 years 7 months ago
Finding Top-k Min-Cost Connected Trees in Databases
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...
Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao...
PKC
2009
Springer
210views Cryptology» more  PKC 2009»
14 years 6 months ago
Controlling Access to an Oblivious Database Using Stateful Anonymous Credentials
In this work, we consider the task of allowing a content provider to enforce complex access control policies on oblivious protocols conducted with anonymous users. As our primary ...
Scott E. Coull, Matthew Green, Susan Hohenberger
CC
2009
Springer
106views System Software» more  CC 2009»
14 years 24 days ago
Blind Optimization for Exploiting Hardware Features
Software systems typically exploit only a small fraction of the realizable performance from the underlying microprocessors. While there has been much work on hardware-aware optimiz...
Dan Knights, Todd Mytkowicz, Peter F. Sweeney, Mic...
CEC
2007
IEEE
14 years 11 days ago
Target shape design optimization by evolving splines
Abstract— Target shape design optimization problem (TSDOP) is a miniature model for real world design optimization problems. It is proposed as a test bed to design and analyze op...
Pan Zhang, Xin Yao, Lei Jia, Bernhard Sendhoff, Th...
SIGMETRICS
2004
ACM
118views Hardware» more  SIGMETRICS 2004»
13 years 11 months ago
A game theoretic approach to provide incentive and service differentiation in P2P networks
Traditional Peer-to-Peer (P2P) networks do not provide service differentiation and incentive for users. Consequently, users can easily access information without contributing any ...
Richard T. B. Ma, Sam C. M. Lee, John C. S. Lui, D...