1150 search results - page 125 / 230 » Note from the Editor |
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
PET
2009
Springer
14 years 3 months ago
2009
Springer
: © Privacy-Preserving Computation and Verification of Aggregate Queries on Outsourced Databases Brian Thompson, Stuart Haber, William G. Horne, Tomas Sander, Danfeng Yao HP Labor...
MADNES
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. This paper contains the summary of a panel on authentication in constrained environments held during the Secure MADNES’05 Workshop. These were transcribed from hand-wri...
FSTTCS
1998
Springer
14 years 1 months ago
1998
Springer
Molecular Computation (MC) is massively parallel computation where data is stored and processed within objects of molecular size. Biomolecular Computation (BMC) is MC using biotec...
JODL
2006
13 years 9 months ago
2006
This paper describes work in progress on the research project CWSpace, sponsored by the MIT and Microsoft Research iCampus program, to investigate the metadata standards and protoc...