Sciweavers

963 search results - page 170 / 193
» Escape Analysis on Lists
Sort
View
82
Voted
PODS
2010
ACM
232views Database» more  PODS 2010»
15 years 5 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
80
Voted
RIDE
2002
IEEE
15 years 5 months ago
A Scheme for Integrating e-Services in Establishing Virtual Enterprises
An important aspect of Business to Business ECommerce is the agile Virtual Enterprise (VE). VEs are established when existing enterprises dynamically form temporary alliances, joi...
Alan Berfield, Panos K. Chrysanthis, Ioannis Tsama...
ICDT
2010
ACM
205views Database» more  ICDT 2010»
15 years 5 months ago
On the Aggregation Problem for Synthesized Web Services
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
Ting Deng, Wenfei Fan, Leonid Libkin, Yinghui Wu
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
15 years 5 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 5 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...