Sciweavers

1492 search results - page 270 / 299
» Testing Properties of Constraint-Graphs
Sort
View
PPOPP
2009
ACM
16 years 9 days ago
Formal verification of practical MPI programs
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...
Anh Vo, Sarvani S. Vakkalanka, Michael Delisi, Gan...
120
Voted
KDD
2008
ACM
134views Data Mining» more  KDD 2008»
16 years 5 days ago
Privacy-preserving cox regression for survival analysis
Privacy-preserving data mining (PPDM) is an emergent research area that addresses the incorporation of privacy preserving concerns to data mining techniques. In this paper we prop...
Shipeng Yu, Glenn Fung, Rómer Rosales, Srir...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 5 days ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
KDD
2006
ACM
272views Data Mining» more  KDD 2006»
16 years 5 days ago
YALE: rapid prototyping for complex data mining tasks
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
Ingo Mierswa, Michael Wurst, Ralf Klinkenberg, Mar...
83
Voted
CHI
2007
ACM
16 years 4 days ago
Hard lessons: effort-inducing interfaces benefit spatial learning
Interface designers normally strive for a design that minimises the user's effort. However, when the design's objective is to train users to interact with interfaces tha...
Andy Cockburn, Per Ola Kristensson, Jason Alexande...