2168 search results - page 319 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
130
click to vote
CCS
2006
ACM
15 years 7 months ago
2006
ACM
Attackers often try to evade an intrusion detection system (IDS) when launching their attacks. There have been several published studies in evasion attacks, some with available to...
149
click to vote
SIGMETRICS
2008
ACM
15 years 3 months ago
2008
ACM
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...
158
click to vote
KDD
2010
ACM
15 years 2 months ago
2010
ACM
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
134
click to vote
WWW
2011
ACM
14 years 11 months ago
2011
ACM
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...
134
click to vote
ICVGIP
2008
15 years 5 months ago
2008
The primitives of point-based representations are independent but are rendered using surfels, which approximate the immediate neighborhood of each point linearly. A large number o...