Sciweavers

2979 search results - page 515 / 596
» Computation and the Periodic Table
Sort
View
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
14 years 10 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 10 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
OSDI
2008
ACM
14 years 10 months ago
Hardware Enforcement of Application Security Policies Using Tagged Memory
Computers are notoriously insecure, in part because application security policies do not map well onto traditional protection mechanisms such as Unix user accounts or hardware pag...
Nickolai Zeldovich, Hari Kannan, Michael Dalton, C...
VLDB
2008
ACM
170views Database» more  VLDB 2008»
14 years 10 months ago
A layered framework supporting personal information integration and application design for the semantic desktop
With the development of inexpensive storage devices, space usage is no longer a bottleneck for computer users. However, the increasingly large amount of personal information poses ...
Isabel F. Cruz, Huiyong Xiao
SIGMOD
2009
ACM
215views Database» more  SIGMOD 2009»
14 years 10 months ago
Efficient type-ahead search on relational data: a TASTIER approach
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng