Sciweavers

301 search results - page 13 / 61
» Narrowing Directed by a Graph of Terms
Sort
View
CAL
2006
13 years 7 months ago
Subtleties of Transactional Memory Atomicity Semantics
Abstract-- Transactional memory has great potential for simplifying multithreaded programming by allowing programmers to specify regions of the program that must appear to execute ...
Milo M. K. Martin, Colin Blundell, E. Lewis
PVLDB
2010
151views more  PVLDB 2010»
13 years 6 months ago
Scalable Discovery of Best Clusters on Large Graphs
The identiļ¬cation of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ļ...
Kathy Macropol, Ambuj K. Singh
CCS
2006
ACM
13 years 11 months ago
A scalable approach to attack graph generation
Attack graphs are important tools for analyzing security vulnerabilities in enterprise networks. Previous work on attack graphs has not provided an account of the scalability of t...
Xinming Ou, Wayne F. Boyer, Miles A. McQueen
PODC
2010
ACM
13 years 11 months ago
Brief announcement: tree decomposition for faster concurrent data structures
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for eļ¬ƒcient complex operations, which lie beyond inserts, deletes ...
Johannes Schneider, Roger Wattenhofer
ICDM
2006
IEEE
129views Data Mining» more  ICDM 2006»
14 years 1 months ago
Keyword Generation for Search Engine Advertising
Keyword3 generation for search engine advertising is an important problem for sponsored search or paidplacement advertising. A recent strategy in this area is bidding on nonobviou...
Amruta Joshi, Rajeev Motwani