Sciweavers

2192 search results - page 90 / 439
» Algorithms for Challenging Motif Problems
Sort
View
IADIS
2003
13 years 9 months ago
Scalability of Cooperative Algorithms for Distributed Architectures of Proxy Servers
Systems consisting of multiple proxy servers are a popular solution to deal with performance and network resource utilization problems related to the growth of the Web numbers. Af...
Riccardo Lancellotti, Francesca Mazzoni, Michele C...
PVLDB
2011
12 years 11 months ago
An Incremental Hausdorff Distance Calculation Algorithm
The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at ...
Sarana Nutanong, Edwin H. Jacox, Hanan Samet
SIGKDD
2008
158views more  SIGKDD 2008»
13 years 8 months ago
KDD cup 2008 and the workshop on mining medical data
In this report we summarize the KDD Cup 2008 task, which addressed a problem of early breast cancer detection. We describe the data and the challenges, the results and summarize t...
R. Bharat Rao, Oksana Yakhnenko, Balaji Krishnapur...
TKDE
2012
199views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Subscriber Assignment for Wide-Area Content-Based Publish/Subscribe
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
Albert Yu, Pankaj K. Agarwal, Jun Yang
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 3 months ago
On Quadratic Programming with a Ratio Objective
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
Aditya Bhaskara, Moses Charikar, Rajsekar Manokara...