Sciweavers

1963 search results - page 229 / 393
» Applications of Preferences using Answer Set Programming
Sort
View
149
Voted
ASPLOS
1996
ACM
15 years 6 months ago
An Integrated Compile-Time/Run-Time Software Distributed Shared Memory System
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...
Sandhya Dwarkadas, Alan L. Cox, Willy Zwaenepoel
140
Voted
CIKM
2010
Springer
15 years 28 days ago
FacetCube: a framework of incorporating prior knowledge into non-negative tensor factorization
Non-negative tensor factorization (NTF) is a relatively new technique that has been successfully used to extract significant characteristics from polyadic data, such as data in s...
Yun Chi, Shenghuo Zhu
WWW
2005
ACM
16 years 3 months ago
Improving text collection selection with coverage and overlap statistics
In an environment of distributed text collections, the first step in the information retrieval process is to identify which of all available collections are more relevant to a giv...
Thomas Hernandez, Subbarao Kambhampati
125
Voted
CCS
2010
ACM
15 years 2 months ago
Input generation via decomposition and re-stitching: finding bugs in Malware
Attackers often take advantage of vulnerabilities in benign software, and the authors of benign software must search their code for bugs in hopes of finding vulnerabilities before...
Juan Caballero, Pongsin Poosankam, Stephen McCaman...
VECPAR
2004
Springer
15 years 7 months ago
Message Strip-Mining Heuristics for High Speed Networks
In this work we investigate how the compiler technique of message strip mining performs in practice on contemporary high performance networks. Message strip mining attempts to redu...
Costin Iancu, Parry Husbands, Wei Chen