Sciweavers

15375 search results - page 2902 / 3075
» cans 2008
Sort
View
CORR
2008
Springer
138views Education» more  CORR 2008»
15 years 6 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 6 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
CORR
2008
Springer
60views Education» more  CORR 2008»
15 years 6 months ago
Enhanced Sensing Characteristics in MEMS-based Formaldehyde Gas Sensor
In this study, the proposed sensor integrates a sensing layer, a heating device, and electrodes on the substrate. The micro heater is integrated in the sensor to provide instantan...
Yu-Hsiang Wang, C.-C. Hsiao, Chia-Yen Lee, Rong-Hu...
CORR
2008
Springer
150views Education» more  CORR 2008»
15 years 6 months 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
CORR
2008
Springer
141views Education» more  CORR 2008»
15 years 6 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner
« Prev « First page 2902 / 3075 Last » Next »