Sciweavers

6274 search results - page 562 / 1255
» From query complexity to computational complexity
Sort
View
DCOSS
2008
Springer
15 years 9 months ago
Decoding Code on a Sensor Node
Abstract. Wireless sensor networks come of age and start moving out of the laboratory into the field. As the number of deployments is increasing the need for an efficient and relia...
Pascal von Rickenbach, Roger Wattenhofer
ALENEX
2010
117views Algorithms» more  ALENEX 2010»
15 years 8 months ago
Untangling the Braid: Finding Outliers in a Set of Streams
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
Chiranjeeb Buragohain, Luca Foschini, Subhash Suri
CONEXT
2009
ACM
15 years 8 months ago
Macroscope: end-point approach to networked application dependency discovery
Enterprise and data center networks consist of a large number of complex networked applications and services that depend upon each other. For this reason, they are difficult to ma...
Lucian Popa 0002, Byung-Gon Chun, Ion Stoica, Jaid...
CGF
2007
171views more  CGF 2007»
15 years 7 months ago
High-Quality Adaptive Soft Shadow Mapping
The recent soft shadow mapping technique [GBP06] allows the rendering in real-time of convincing soft shadows on complex and dynamic scenes using a single shadow map. While attrac...
Gaël Guennebaud, Loïc Barthe, Mathias Pa...
SIAMJO
2008
86views more  SIAMJO 2008»
15 years 7 months ago
On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection
We study the second-order feasibility cone F = {y IRn : My gT y} for given data (M, g). We construct a new representation for this cone and its dual based on the spectral decompo...
Alexandre Belloni, Robert M. Freund