Sciweavers

2124 search results - page 168 / 425
» Repairing Structurally Complex Data
Sort
View
121
Voted
NIPS
2008
15 years 2 months ago
Partially Observed Maximum Entropy Discrimination Markov Networks
Learning graphical models with hidden variables can offer semantic insights to complex data and lead to salient structured predictors without relying on expensive, sometime unatta...
Jun Zhu, Eric P. Xing, Bo Zhang
102
Voted
HPCC
2010
Springer
15 years 1 months ago
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-Grained Parallelism
This paper presents an algorithm and a data structure for scalable dynamic synchronization in fine-grained parallelism. The algorithm supports the full generality of phasers with d...
Stefan Marr, Stijn Verhaegen, Bruno De Fraine, The...
PVLDB
2010
103views more  PVLDB 2010»
14 years 11 months ago
Fast Optimal Twig Joins
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
Nils Grimsmo, Truls Amundsen Bjørklund, Mag...
CADE
2005
Springer
16 years 29 days ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
JSS
2007
126views more  JSS 2007»
15 years 16 days ago
Fine-grain analysis of common coupling and its application to a Linux case study
Common coupling (sharing global variables across modules) is widely accepted as a measure of software quality and maintainability; a low level of common coupling is necessary (but...
Dror G. Feitelson, Tokunbo O. S. Adeshiyan, Daniel...