Sciweavers

630 search results - page 120 / 126
» Hardness results for approximating the bandwidth
Sort
View
ICDT
2010
ACM
211views Database» more  ICDT 2010»
15 years 6 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis
SDM
2009
SIAM
219views Data Mining» more  SDM 2009»
15 years 6 months ago
A Hybrid Data Mining Metaheuristic for the p-Median Problem.
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In t...
Alexandre Plastino, Erick R. Fonseca, Richard Fuch...
CIKM
2009
Springer
15 years 4 months ago
Evaluating top-k queries over incomplete data streams
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
Parisa Haghani, Sebastian Michel, Karl Aberer
GECCO
2009
Springer
138views Optimization» more  GECCO 2009»
15 years 4 months ago
IMAD: in-execution malware analysis and detection
The sophistication of computer malware is becoming a serious threat to the information technology infrastructure, which is the backbone of modern e-commerce systems. We, therefore...
Syed Bilal Mehdi, Ajay Kumar Tanwani, Muddassar Fa...
91
Voted
IMC
2009
ACM
15 years 4 months ago
Scalable proximity estimation and link prediction in online social networks
Proximity measures quantify the closeness or similarity between nodes in a social network and form the basis of a range of applications in social sciences, business, information t...
Han Hee Song, Tae Won Cho, Vacha Dave, Yin Zhang, ...