Sciweavers

1650 search results - page 320 / 330
» The HOM problem is decidable
Sort
View
PET
2010
Springer
13 years 11 months ago
Private Information Disclosure from Web Searches
As the amount of personal information stored at remote service providers increases, so does the danger of data theft. When connections to remote services are made in the clear and ...
Claude Castelluccia, Emiliano De Cristofaro, Danie...
CICLING
2009
Springer
13 years 11 months ago
Language Identification on the Web: Extending the Dictionary Method
Abstract. Automated language identification of written text is a wellestablished research domain that has received considerable attention in the past. By now, efficient and effecti...
Radim Rehurek, Milan Kolkus
SOUPS
2010
ACM
13 years 11 months ago
Folk models of home computer security
Home computer systems are frequently insecure because they are administered by untrained, unskilled users. The rise of botnets has amplified this problem; attackers can compromis...
Rick Wash
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
13 years 11 months ago
Small Spans in Scaled Dimension
Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time,...
John M. Hitchcock
CAISE
2006
Springer
13 years 11 months ago
Bridging the Gap between Data Warehouses and Organizations
Abstract. Data Warehouse (DWH) systems are used by decision makers for performance measurement and decision support. Currently the main focus of the DWH research field is not as mu...
Veronika Stefanov