Sciweavers

318 search results - page 39 / 64
» Real Number Computability and Domain Theory
Sort
View
IS
2007
13 years 8 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
KDD
2008
ACM
174views Data Mining» more  KDD 2008»
14 years 9 months ago
Automatic identification of quasi-experimental designs for discovering causal knowledge
Researchers in the social and behavioral sciences routinely rely on quasi-experimental designs to discover knowledge from large databases. Quasi-experimental designs (QEDs) exploi...
David D. Jensen, Andrew S. Fast, Brian J. Taylor, ...
ATAL
2008
Springer
13 years 11 months ago
A tractable and expressive class of marginal contribution nets and its applications
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
FOCS
2009
IEEE
14 years 3 months ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...
JMIV
2008
214views more  JMIV 2008»
13 years 8 months ago
A Network Flow Algorithm for Reconstructing Binary Images from Continuous X-rays
Tomography is a powerful technique to obtain accurate images of the interior of an object in a nondestructive way. Conventional reconstruction algorithms, such as filtered backproj...
Kees Joost Batenburg