Sciweavers

2066 search results - page 395 / 414
» Component-Based Programming of Distributed Applications
Sort
View
113
Voted
WWW
2009
ACM
16 years 1 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
WWW
2002
ACM
16 years 1 months ago
Simulation, verification and automated composition of web services
Web services -- Web-accessible programs and devices ? are a key application area for the Semantic Web. With the proliferation of Web services and the evolution towards the Semanti...
Srini Narayanan, Sheila A. McIlraith
139
Voted
COORDINATION
2009
Springer
16 years 1 months ago
Enhanced Coordination in Sensor Networks through Flexible Service Provisioning
: Heterogeneous wireless sensor networks represent a challenging programming environment. Servilla addresses this by offering a new middleware framework that provides service provi...
Chien-Liang Fok, Gruia-Catalin Roman, Chenyang Lu
114
Voted
KDD
2009
ACM
198views Data Mining» more  KDD 2009»
16 years 1 months ago
Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse Netflix data
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
Srivatsava Daruru, Nena M. Marin, Matt Walker, Joy...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 26 days ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen