Sciweavers

9532 search results - page 1557 / 1907
» Logic, Graphs, and Algorithms
Sort
View
IEEESCC
2009
IEEE
15 years 4 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
CORR
2011
Springer
172views Education» more  CORR 2011»
15 years 1 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
PVLDB
2011
15 years 1 months ago
Personalized Social Recommendations - Accurate or Private?
With the recent surge of social networks such as Facebook, new forms of recommendations have become possible – recommendations that rely on one’s social connections in order t...
Ashwin Machanavajjhala, Aleksandra Korolova, Atish...
BCB
2010
213views Bioinformatics» more  BCB 2010»
15 years 1 months ago
Markov clustering of protein interaction networks with improved balance and scalability
Markov Clustering (MCL) is a popular algorithm for clustering networks in bioinformatics such as protein-protein interaction networks and protein similarity networks. An important...
Venu Satuluri, Srinivasan Parthasarathy, Duygu Uca...
PAMI
2010
188views more  PAMI 2010»
15 years 1 months ago
Watershed Cuts: Thinnings, Shortest Path Forests, and Topological Watersheds
We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, our main contribution is a thinning paradigm from which we derive three alg...
Jean Cousty, Gilles Bertrand, Laurent Najman, Mich...
« Prev « First page 1557 / 1907 Last » Next »