Sciweavers

10909 search results - page 1994 / 2182
» Evaluating Backup Algorithms
Sort
View
IPSN
2011
Springer
14 years 8 months ago
SpiderBat: Augmenting wireless sensor networks with distance and angle information
Having access to accurate position information is a key requirement for many wireless sensor network applications. We present the design, implementation and evaluation of SpiderBa...
Georg Oberholzer, Philipp Sommer, Roger Wattenhofe...
POPL
2011
ACM
14 years 7 months ago
Safe nondeterminism in a deterministic-by-default parallel language
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
Robert L. Bocchino Jr., Stephen Heumann, Nima Hona...
SDM
2011
SIAM
232views Data Mining» more  SDM 2011»
14 years 7 months ago
A Sequential Dual Method for Structural SVMs
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...
Shirish Krishnaj Shevade, Balamurugan P., S. Sunda...
SIGIR
2011
ACM
14 years 7 months ago
Picasso - to sing, you must close your eyes and draw
We study the problem of automatically assigning appropriate music pieces to a picture or, in general, series of pictures. This task, commonly referred to as soundtrack suggestion,...
Aleksandar Stupar, Sebastian Michel
SIGMETRICS
2011
ACM
229views Hardware» more  SIGMETRICS 2011»
14 years 7 months ago
Model-driven optimization of opportunistic routing
Opportunistic routing aims to improve wireless performance by exploiting communication opportunities arising by chance. A key challenge in opportunistic routing is how to achieve ...
Eric Rozner, Mi Kyung Han, Lili Qiu, Yin Zhang
« Prev « First page 1994 / 2182 Last » Next »