Sciweavers

3495 search results - page 661 / 699
» On the random satisfiable process
Sort
View
WWW
2007
ACM
16 years 15 days 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...
WWW
2007
ACM
16 years 15 days ago
Long distance wireless mesh network planning: problem formulation and solution
Several research efforts as well as deployments have chosen IEEE 802.11 as a low-cost, long-distance access technology to bridge the digital divide. In this paper, we consider the...
Sayandeep Sen, Bhaskaran Raman
MOBIHOC
2009
ACM
16 years 11 days 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
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
16 years 7 days ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
KDD
2006
ACM
128views Data Mining» more  KDD 2006»
16 years 7 days ago
On privacy preservation against adversarial data mining
Privacy preserving data processing has become an important topic recently because of advances in hardware technology which have lead to widespread proliferation of demographic and...
Charu C. Aggarwal, Jian Pei, Bo Zhang 0002