Sciweavers

1167 search results - page 218 / 234
» Relational Markov Games
Sort
View
JCDL
2006
ACM
151views Education» more  JCDL 2006»
15 years 11 months ago
Tagging of name records for genealogical data browsing
In this paper we present a method of parsing unstructured textual records briefly describing a person and their direct relatives, which we use in the construction of a browsing t...
Mike Perrow, David Barber
CLUSTER
2005
IEEE
15 years 11 months ago
Minimizing the Network Overhead of Checkpointing in Cycle-harvesting Cluster Environments
Cycle-harvesting systems such as Condor have been developed to make desktop machines in a local area (which are often similar to clusters in hardware configuration) available as ...
Daniel Nurmi, John Brevik, Richard Wolski
CCS
2005
ACM
15 years 11 months ago
Fast dictionary attacks on passwords using time-space tradeoff
Human-memorable passwords are a mainstay of computer security. To decrease vulnerability of passwords to bruteforce dictionary attacks, many organizations enforce complicated pass...
Arvind Narayanan, Vitaly Shmatikov
MOBICOM
2004
ACM
15 years 11 months ago
PAVAN: a policy framework for content availabilty in vehicular ad-hoc networks
Advances in wireless communication, storage and processing are realizing next-generation in-vehicle entertainment systems. Even if hundreds of different video or audio titles are...
Shahram Ghandeharizadeh, Shyam Kapadia, Bhaskar Kr...
128
Voted
FOCS
2003
IEEE
15 years 10 months ago
Approximation Algorithms for Orienteering and Discounted-Reward TSP
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
Avrim Blum, Shuchi Chawla, David R. Karger, Terran...