Sciweavers

245 search results - page 48 / 49
» Dynamics of conversations
Sort
View
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 6 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
14 years 6 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng
HPDC
2007
IEEE
14 years 10 days ago
A statistical approach to risk mitigation in computational markets
We study stochastic models to mitigate the risk of poor Quality-of-Service (QoS) in computational markets. Consumers who purchase services expect both price and performance guaran...
Thomas Sandholm, Kevin Lai
HPCC
2005
Springer
13 years 11 months ago
Enabling the P2P JXTA Platform for High-Performance Networking Grid Infrastructures
Abstract. As grid sizes increase, the need for self-organization and dynamic reconfigurations is becoming more and more important, and therefore the convergence of grid computing ...
Gabriel Antoniu, Mathieu Jan, David A. Noblet
ICFEM
2005
Springer
13 years 11 months ago
A Compositional Framework for Service Interaction Patterns and Interaction Flows
We provide precise high-level models for eight fundamental service interaction patterns, together with schemes for their composition into complex service-based business process int...
Alistair P. Barros, Egon Börger