Sciweavers

1081 search results - page 83 / 217
» Working with the LR Degrees
Sort
View
79
Voted
IJAR
2011
62views more  IJAR 2011»
14 years 4 months ago
Measuring and repairing inconsistency in probabilistic knowledge bases
In this paper we present a family of measures aimed at determining the amount of inconsistency in probabilistic knowledge bases. Our approach to measuring inconsistency is graded ...
David Picado-Muiño
146
Voted
PLDI
2012
ACM
13 years 3 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
135
Voted
PAMI
2012
13 years 3 months ago
Quantifying and Transferring Contextual Information in Object Detection
— Context is critical for reducing the uncertainty in object detection. However, context modelling is challenging because there are often many different types of contextual infor...
Wei-Shi Zheng, Shaogang Gong, Tao Xiang
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
13 years 3 months ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri
123
Voted
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
13 years 3 months ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström