Sciweavers

662 search results - page 130 / 133
» Adventures in Personalized Information Access
Sort
View
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 14 days 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...
CCS
2009
ACM
14 years 9 days ago
TruWallet: trustworthy and migratable wallet-based web authentication
Identity theft has fostered to a major security problem on the Internet, in particular stealing passwords for web applications through phishing and malware. We present TruWallet, ...
Sebastian Gajek, Hans Löhr, Ahmad-Reza Sadegh...
ICPADS
1998
IEEE
13 years 12 months ago
User-Defined Telecooperation Services
A user-defined telecooperation service (UTS) provides service elements for application-specific communication and cooperation processes as well as integrated means for the service...
Volker Gruhn, Peter Herrmann, Heiko Krumm
HOTOS
1993
IEEE
13 years 11 months ago
Object Groups May Be Better Than Pages
I argue against trying to solve the problem of clustering objects into disk pages. Instead, I propose that objects be fetched in groups that may be specific to an application or ...
Mark Day
CODES
2007
IEEE
13 years 11 months ago
Influence of procedure cloning on WCET prediction
For the worst-case execution time (WCET) analysis, especially loops are an inherent source of unpredictability and loss of precision. This is caused by the difficulty to obtain sa...
Paul Lokuciejewski, Heiko Falk, Martin Schwarzer, ...