Sciweavers

5153 search results - page 932 / 1031
» Introduction to Randomized Algorithms
Sort
View
104
Voted
IPMI
2003
Springer
16 years 3 months ago
Expectation Maximization Strategies for Multi-atlas Multi-label Segmentation
It is well-known in the pattern recognition community that the accuracy of classifications obtained by combining decisions made by independent classifiers can be substantially high...
Torsten Rohlfing, Daniel B. Russakoff, Calvin R. M...
WWW
2007
ACM
16 years 3 months ago
Preference-based selection of highly configurable web services
A key challenge for dynamic Web service selection is that Web services are typically highly configurable and service requesters often have dynamic preferences on service configura...
Steffen Lamparter, Anupriya Ankolekar, Rudi Studer...
MOBIHOC
2009
ACM
16 years 3 months ago
Predict and relay: an efficient routing in disruption-tolerant networks
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
Quan Yuan, Ionut Cardei, Jie Wu
111
Voted
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
16 years 2 months ago
Detecting research topics via the correlation between graphs and texts
In this paper we address the problem of detecting topics in large-scale linked document collections. Recently, topic detection has become a very active area of research due to its...
Yookyung Jo, Carl Lagoze, C. Lee Giles
119
Voted
STOC
2007
ACM
140views Algorithms» more  STOC 2007»
16 years 2 months ago
On the submodularity of influence in social networks
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
Elchanan Mossel, Sébastien Roch