Sciweavers

5973 search results - page 814 / 1195
» Fundamental forms of information
Sort
View
DEBS
2007
ACM
15 years 10 months ago
A taxonomy for denial of service attacks in content-based publish/subscribe systems
Denial of Service (DoS) attacks continue to affect the availability of critical systems on the Internet. The existing DoS problem is enough to merit significant research dedicated...
Alex Wun, Alex King Yeung Cheung, Hans-Arno Jacobs...
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
15 years 10 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
CHI
2010
ACM
15 years 10 months ago
Characteristics of pressure-based input for mobile devices
We conducted a series of user studies to understand and clarify the fundamental characteristics of pressure in user interfaces for mobile devices. We seek to provide insight to cl...
Craig Stewart, Michael Rohs, Sven G. Kratz, Georg ...
USENIX
2007
15 years 9 months ago
From Trusted to Secure: Building and Executing Applications That Enforce System Security
Commercial operating systems have recently introduced mandatory access controls (MAC) that can be used to ensure system-wide data confidentiality and integrity. These protections...
Boniface Hicks, Sandra Rueda, Trent Jaeger, Patric...
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 9 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan