Sciweavers

817 search results - page 157 / 164
» A Declarative Framework for Analysis and Optimization
Sort
View
COMPGEOM
2009
ACM
14 years 2 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
INFOCOM
2008
IEEE
14 years 2 months ago
A Novel Quantitative Approach For Measuring Network Security
—Evaluation of network security is an essential step in securing any network. This evaluation can help security professionals in making optimal decisions about how to design secu...
Mohammad Salim Ahmed, Ehab Al-Shaer, Latifur Khan
ICC
2007
IEEE
156views Communications» more  ICC 2007»
14 years 1 months ago
CA-AQM: Channel-Aware Active Queue Management for Wireless Networks
—In a wireless network, data transmission suffers from varied signal strengths and channel bit error rates. To ensure successful packet reception under different channel conditio...
Yuan Xue, Hoang Nguyen, Klara Nahrstedt
ICRA
2007
IEEE
175views Robotics» more  ICRA 2007»
14 years 1 months ago
Visual Servoing in Non-Rigid Environments: A Space-Time Approach
— Most robotic vision algorithms are proposed by envisaging robots operating in structured environments where the world is assumed to be rigid. These algorithms fail to provide o...
D. Santosh, C. V. Jawahar
ICALP
2007
Springer
14 years 1 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson