Sciweavers

449 search results - page 82 / 90
» Degenerate crossing numbers
Sort
View
STOC
2007
ACM
140views Algorithms» more  STOC 2007»
14 years 7 months ago
On the submodularity of influence in social networks
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
Elchanan Mossel, Sébastien Roch
ICSE
2008
IEEE-ACM
14 years 7 months ago
Proposing SQL statement coverage metrics
An increasing number of cyber attacks are occurring at the application layer when attackers use malicious input. These input validation vulnerabilities can be exploited by (among ...
Ben H. Smith, Yonghee Shin, Laurie Williams
EWSN
2008
Springer
14 years 7 months ago
Radio Characterization of 802.15.4 and Its Impact on the Design of Mobile Sensor Networks
Future mobile sensing systems are being designed using 802.15.4 low-power short-range radios for a diverse set of devices from embedded mobile motes to sensor-enabled cellphones in...
Emiliano Miluzzo, Xiao Zheng, Kristof Fodor, Andre...
FOCS
2009
IEEE
14 years 2 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi
FOCS
2008
IEEE
14 years 1 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...