Sciweavers

6455 search results - page 1133 / 1291
» Research problems
Sort
View
JUCS
2010
114views more  JUCS 2010»
13 years 5 months ago
On Reliable Platform Configuration Change Reporting Mechanisms for Trusted Computing Enabled Platforms
: One of the most important use-cases of Trusted Computing is Remote Attestation. It allows platforms to get a trustworthy proof of the loaded software and current configuration of...
Kurt Dietrich
NA
2010
104views more  NA 2010»
13 years 5 months ago
New interpolants for asymptotically correct defect control of BVODEs
The defect of a continuous approximate solution to an ODE is the amount by which that approximation fails to satisfy the ODE. A number of studies have explored the use of asymptot...
Wayne H. Enright, P. H. Muir
TASE
2010
IEEE
13 years 5 months ago
Robust Calibration for Localization in Clustered Wireless Sensor Networks
This paper presents a robust calibration procedure for clustered wireless sensor networks. Accurate calibration of between-node distances is one crucial step in localizing sensor n...
Jung Jin Cho, Yu Ding, Yong Chen, Jiong Tang
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
12 years 10 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 6 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
« Prev « First page 1133 / 1291 Last » Next »