Sciweavers

974 search results - page 179 / 195
» pairing 2010
Sort
View
ICSE
2010
IEEE-ACM
14 years 10 days ago
DETERMIN: inferring likely deterministic specifications of multithreaded programs
The trend towards multicore processors and graphic processing units is increasing the need for software that can take advantage of parallelism. Writing correct parallel programs u...
Jacob Burnim, Koushik Sen
PODS
2010
ACM
223views Database» more  PODS 2010»
14 years 5 days ago
Characterizing schema mappings via data examples
Schema mappings are high-level specifications that describe the relationship between two database schemas; they are considered to be the essential building blocks in data exchange...
Bogdan Alexe, Phokion G. Kolaitis, Wang Chiew Tan
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
13 years 12 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
ASUNAM
2010
IEEE
13 years 12 months ago
COSI: Cloud Oriented Subgraph Identification in Massive Social Networks
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
AAAI
2010
13 years 11 months ago
Compilation Complexity of Common Voting Rules
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
Lirong Xia, Vincent Conitzer