Sciweavers

740 search results - page 136 / 148
» Open Answer Set Programming with Guarded Programs
Sort
View
ICALP
2011
Springer
12 years 11 months ago
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
Sanjeev Arora, Rong Ge
SIGMOD
2011
ACM
297views Database» more  SIGMOD 2011»
12 years 10 months ago
Apples and oranges: a comparison of RDF benchmarks and real RDF datasets
The widespread adoption of the Resource Description Framework (RDF) for the representation of both open web and enterprise data is the driving force behind the increasing research...
Songyun Duan, Anastasios Kementsietsidis, Kavitha ...
SIGSOFT
2008
ACM
14 years 8 months ago
Javert: fully automatic mining of general temporal properties from dynamic traces
Program specifications are important for many tasks during software design, development, and maintenance. Among these, temporal specifications are particularly useful. They expres...
Mark Gabel, Zhendong Su
CCS
2009
ACM
14 years 2 months ago
Behavior based software theft detection
Along with the burst of open source projects, software theft (or plagiarism) has become a very serious threat to the healthiness of software industry. Software birthmark, which re...
Xinran Wang, Yoon-chan Jhi, Sencun Zhu, Peng Liu
IPPS
2009
IEEE
14 years 2 months ago
Phaser accumulators: A new reduction construct for dynamic parallelism
A reduction is a computation in which a common operation, such as a sum, is to be performed across multiple pieces of data, each supplied by a separate task. We introduce phaser a...
Jun Shirako, David M. Peixotto, Vivek Sarkar, Will...