Sciweavers

16616 search results - page 3066 / 3324
» Extending Extended Vacuity
Sort
View
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 11 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
212
Voted
ESWS
2010
Springer
15 years 11 months ago
Finding Your Way through the Rijksmuseum with an Adaptive Mobile Museum Guide
Abstract. This paper describes a real-time routing system that implements a mobile museum tour guide for providing personalized tours tailored to the user position inside the museu...
Willem Robert van Hage, Natalia Stash, Yiwen Wang,...
ESWS
2010
Springer
15 years 11 months ago
Guarding a Walled Garden - Semantic Privacy Preferences for the Social Web
Abstract. With increasing usage of Social Networks, giving users the possibility to establish access restrictions on their data and resources becomes more and more important. Howev...
Philipp Kärger, Wolf Siberski
172
Voted
EUROCRYPT
2010
Springer
15 years 11 months ago
Bounded Key-Dependent Message Security
We construct the first public-key encryption scheme that is proven secure (in the standard model, under standard assumptions) even when the attacker gets access to encryptions of ...
Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval...
FUN
2010
Springer
233views Algorithms» more  FUN 2010»
15 years 11 months ago
The Complexity of Flood Filling Games
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
David Arthur, Raphaël Clifford, Markus Jalsen...
« Prev « First page 3066 / 3324 Last » Next »