Sciweavers

10890 search results - page 2089 / 2178
» Automatic Complexity Analysis
Sort
View
IPSN
2007
Springer
16 years 11 days ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
IPSN
2007
Springer
16 years 11 days ago
Tracking multiple targets using binary proximity sensors
Recent work has shown that, despite the minimal information provided by a binary proximity sensor, a network of such sensors can provide remarkably good target tracking performanc...
Jaspreet Singh, Upamanyu Madhow, Rajesh Kumar 0003...
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
16 years 11 days ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
LADC
2007
Springer
16 years 11 days ago
Security Patterns and Secure Systems Design
Analysis and design patterns are well established as a convenient and reusable way to build high-quality object-oriented software. Patterns combine experience and good practices t...
Eduardo B. Fernández
OOPSLA
2007
Springer
16 years 10 days ago
Scalable omniscient debugging
Omniscient debuggers make it possible to navigate backwards in time within a program execution trace, drastically improving the task of debugging complex applications. Still, they...
Guillaume Pothier, Éric Tanter, José...
« Prev « First page 2089 / 2178 Last » Next »