Sciweavers

45 search results - page 4 / 9
» Extending GQM by Argument Structures
Sort
View
ESA
2011
Springer
251views Algorithms» more  ESA 2011»
12 years 7 months ago
Improved Approximation Algorithms for Bipartite Correlation Clustering
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke...
TACAS
2012
Springer
316views Algorithms» more  TACAS 2012»
12 years 3 months ago
Compositional Termination Proofs for Multi-threaded Programs
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
Corneliu Popeea, Andrey Rybalchenko
COLING
2010
13 years 2 months ago
Learning the Scope of Negation via Shallow Semantic Parsing
In this paper we present a simplified shallow semantic parsing approach to learning the scope of negation (SoN). This is done by formulating it as a shallow semantic parsing probl...
Junhui Li, Guodong Zhou, Hongling Wang, Qiaoming Z...
CORR
2007
Springer
111views Education» more  CORR 2007»
13 years 7 months ago
Separable and Low-Rank Continuous Games
— Separable games are a structured subclass of continuous games whose payoffs take a sum-of-products form; the zero-sum case has been studied in earlier work. Included in this su...
Noah D. Stein, Asuman E. Ozdaglar, Pablo A. Parril...
IWMM
1992
Springer
85views Hardware» more  IWMM 1992»
13 years 11 months ago
An Implementation of an Applicative File System
A purely functional le system has been built on top of pure Scheme. It provides persistent structures and massive storage expected of le systems, without explicit side-e ects like ...
Brian C. Heck, David S. Wise