Sciweavers

998 search results - page 94 / 200
» From Feasible Proofs to Feasible Computations
Sort
View
INFOCOM
2006
IEEE
14 years 2 months ago
Trade-Off Curves for QoS Routing
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...
Piet Van Mieghem, Lieven Vandenberghe
WACV
2005
IEEE
14 years 2 months ago
Measures of Similarity
Quantitative evaluation and comparison of image segmentation algorithms is now feasible owing to the recent availability of collections of hand-labeled images. However, little att...
Ranjith Unnikrishnan, Martial Hebert
CPHYSICS
2007
100views more  CPHYSICS 2007»
13 years 9 months ago
Dielectric anisotropy in the GW space-time method
Excited-state calculations, notably for quasiparticle band structures, are nowadays routinely performed within the GW approximation for the electronic self-energy. Nevertheless, c...
Christoph Freysoldt, Philipp Eggert, Patrick Rinke...
GLOBECOM
2008
IEEE
14 years 3 months ago
An Upper Bound on Network Size in Mobile Ad-Hoc Networks
—In this paper we propose a model to compute an upper bound for the maximum network size in mobile ad-hoc networks. Our model is based on the foundation that for a unicast route ...
Michael Pascoe, Javier Gomez, Victor Rangel, Migue...
SP
2008
IEEE
115views Security Privacy» more  SP 2008»
13 years 8 months ago
Compromising Reflections-or-How to Read LCD Monitors around the Corner
We present a novel eavesdropping technique for spying at a distance on data that is displayed on an arbitrary computer screen, including the currently prevalent LCD monitors. Our ...
Michael Backes, Markus Dürmuth, Dominique Unr...