Sciweavers

544 search results - page 103 / 109
» What cannot be computed locally!
Sort
View
FOCS
2008
IEEE
13 years 11 months ago
Set Covering with our Eyes Closed
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi,...
BMCBI
2008
211views more  BMCBI 2008»
13 years 10 months ago
CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
Svetlin Manavski, Giorgio Valle
CVPR
2012
IEEE
12 years 7 days ago
Weakly supervised structured output learning for semantic segmentation
We address the problem of weakly supervised semantic segmentation. The training images are labeled only by the classes they contain, not by their location in the image. On test im...
Alexander Vezhnevets, Vittorio Ferrari, Joachim M....
SIGMOD
2002
ACM
108views Database» more  SIGMOD 2002»
14 years 10 months ago
An adaptive peer-to-peer network for distributed caching of OLAP results
Peer-to-Peer (P2P) systems are becoming increasingly popular as they enable users to exchange digital information by participating in complex networks. Such systems are inexpensiv...
Panos Kalnis, Wee Siong Ng, Beng Chin Ooi, Dimitri...
ACSAC
2007
IEEE
14 years 4 months ago
Limits of Static Analysis for Malware Detection
Malicious code is an increasingly important problem that threatens the security of computer systems. The traditional line of defense against malware is composed of malware detecto...
Andreas Moser, Christopher Kruegel, Engin Kirda