Sciweavers

6266 search results - page 1179 / 1254
» New results on the computability and complexity of points - ...
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
STACS
2001
Springer
14 years 4 days ago
A Toolkit for First Order Extensions of Monadic Games
In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form...
David Janin, Jerzy Marcinkowski
CA
1999
IEEE
14 years 1 days ago
Virtual People: Capturing Human Models to Populate Virtual Worlds
In this paper a new technique is introduced for automatically building recognisable moving 3D models of individual people. Realistic modelling of people is essential for advanced ...
Adrian Hilton, Daniel Beresford, Thomas Gentils, R...
DEBS
2007
ACM
13 years 11 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...
CCS
2001
ACM
13 years 11 months ago
A verifiable secret shuffle and its application to e-voting
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
C. Andrew Neff
« Prev « First page 1179 / 1254 Last » Next »