Sciweavers

1760 search results - page 269 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
WWW
2010
ACM
14 years 2 months ago
Selecting skyline services for QoS-based web service composition
Web service composition enables seamless and dynamic integration of business applications on the web. The performance of the composed application is determined by the performance ...
Mohammad Alrifai, Dimitrios Skoutas, Thomas Risse
ADCM
2010
90views more  ADCM 2010»
13 years 8 months ago
Local reconstruction for sampling in shift-invariant spaces
The local reconstruction from samples is one of most desirable properties for many applications in signal processing, but it has not been given as much attention. In this paper, we...
Qiyu Sun
BMCBI
2007
141views more  BMCBI 2007»
13 years 7 months ago
A novel approach to detect hot-spots in large-scale multivariate data
Background: Progressive advances in the measurement of complex multifactorial components of biological processes involving both spatial and temporal domains have made it difficult...
Jianhua Wu, Keith M. Kendrick, Jianfeng Feng
PKDD
2010
Springer
235views Data Mining» more  PKDD 2010»
13 years 5 months ago
Online Structural Graph Clustering Using Frequent Subgraph Mining
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
Madeleine Seeland, Tobias Girschick, Fabian Buchwa...
AML
2011
204views Mathematics» more  AML 2011»
13 years 2 months ago
A note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
Jan Krajícek