Sciweavers

152 search results - page 17 / 31
» Expected time analysis for Delaunay point location
Sort
View
ADHOC
2007
71views more  ADHOC 2007»
14 years 12 months ago
Service capacity in vehicular networks: A resource dissemination analysis
The support of peer-to-peer (P2P) resource sharing in dynamic scenarios is one of the most challenging research fields for both its expected commercial and technological impact o...
Laura Galluccio, Alessandro Leonardi, Antonio Mate...
ESORICS
2009
Springer
15 years 6 months ago
Privacy Preserving Publication of Moving Object Data
The increasing availability of space-time trajectories left by location-aware devices is expected to enable novel classes of applications where the discovery of consumable, concise...
Francesco Bonchi
CORR
2010
Springer
178views Education» more  CORR 2010»
14 years 10 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
Daniel Dadush, Chris Peikert, Santosh Vempala
PSYCHNOLOGY
2008
156views more  PSYCHNOLOGY 2008»
14 years 11 months ago
SIM: A dynamic multidimensional visualization method for social networks
Visualization plays an important role in social networks analysis to explore and investigate individual and groups behaviours. Therefore, different approaches have been proposed f...
Maria Chiara Caschera, Fernando Ferri, Patrizia Gr...
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 1 days ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup