Sciweavers

1941 search results - page 95 / 389
» On the Hardness of Approximate Reasoning
Sort
View
INFOCOM
2008
IEEE
15 years 6 months ago
Feasible Rate Allocation in Wireless Networks
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
CORR
2008
Springer
150views Education» more  CORR 2008»
15 years 44 min ago
A Local Mean Field Analysis of Security Investments in Networks
Getting agents in the Internet, and in networks in general, to invest in and deploy security features and protocols is a challenge, in particular because of economic reasons arisi...
Marc Lelarge, Jean Bolot
WWW
2008
ACM
16 years 17 days ago
Optimal marketing strategies over social networks
We discuss the use of social networks in implementing viral marketing strategies. While influence maximization has been studied in this context (see Chapter 24 of [10]), we study ...
Jason D. Hartline, Vahab S. Mirrokni, Mukund Sunda...
CVPR
2009
IEEE
15 years 6 months ago
Robust shadow and illumination estimation using a mixture model
Illuminant estimation from shadows typically relies on accurate segmentation of the shadows and knowledge of exact 3D geometry, while shadow estimation is difficult in the presen...
Alexandros Panagopoulos, Dimitris Samaras, Nikos P...
OOPSLA
2007
Springer
15 years 6 months ago
Ilea: inter-language analysis across java and c
Java bug finders perform static analysis to find implementation mistakes that can lead to exploits and failures; Java compilers perform static analysis for optimization. If Java...
Gang Tan, Greg Morrisett