Sciweavers

2703 search results - page 538 / 541
» Working Class Hero
Sort
View
POPL
2011
ACM
12 years 11 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
PROCEDIA
2011
12 years 11 months ago
GPU-accelerated Chemical Similarity Assessment for Large Scale Databases
The assessment of chemical similarity between molecules is a basic operation in chemoinformatics, a computational area concerning with the manipulation of chemical structural info...
Marco Maggioni, Marco D. Santambrogio, Jie Liang
SIGIR
2011
ACM
12 years 11 months ago
Faster top-k document retrieval using block-max indexes
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
Shuai Ding, Torsten Suel
SIGMOD
2011
ACM
297views Database» more  SIGMOD 2011»
12 years 11 months ago
Graph cube: on warehousing and OLAP multidimensional networks
We consider extending decision support facilities toward large sophisticated networks, upon which multidimensional attributes are associated with network entities, thereby forming...
Peixiang Zhao, Xiaolei Li, Dong Xin, Jiawei Han
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
12 years 8 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge