Sciweavers

1204 search results - page 231 / 241
» Database research in computer games
Sort
View
PPOPP
2009
ACM
14 years 10 months ago
Safe open-nested transactions through ownership
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
Kunal Agrawal, I.-Ting Angelina Lee, Jim Sukha
HPCA
2006
IEEE
14 years 10 months ago
DMA-aware memory energy management
As increasingly larger memories are used to bridge the widening gap between processor and disk speeds, main memory energy consumption is becoming increasingly dominant. Even thoug...
Vivek Pandey, Weihang Jiang, Yuanyuan Zhou, Ricard...
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
14 years 7 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
RECSYS
2009
ACM
14 years 4 months ago
Conceptual recommender system for CiteSeerX
Short search engine queries do not provide contextual information, making it difficult for traditional search engines to understand what users are really requesting. One approach ...
Ajith Kodakateri Pudhiyaveetil, Susan Gauch, Hiep ...
ICALP
2007
Springer
14 years 4 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson