Sciweavers

272 search results - page 40 / 55
» Minimal Function Graphs are not Instrumented
Sort
View
ICDCS
2006
IEEE
14 years 3 months ago
Greedy is Good: On Service Tree Placement for In-Network Stream Processing
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
Zoë Abrams, Jie Liu
SIAMDM
2010
149views more  SIAMDM 2010»
13 years 8 months ago
Formal Theory of Noisy Sensor Network Localization
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
Brian D. O. Anderson, Iman Shames, Guoqiang Mao, B...
AWPN
2008
311views Algorithms» more  AWPN 2008»
13 years 11 months ago
WoPeD 2.0 goes BPEL 2.0
WoPeD (Workflow Petrinet Designer) is an easy-to-use, Java-based open source software tool being developed at the University of Cooperative Education, Karlsruhe. WoPeD is able to e...
Andreas Eckleder, Thomas Freytag
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 8 months ago
Gaussian Process Structural Equation Models with Latent Variables
In a variety of disciplines such as social sciences, psychology, medicine and economics, the recorded data are considered to be noisy measurements of latent variables connected by...
Ricardo Silva
ICML
2006
IEEE
14 years 10 months ago
Nonstationary kernel combination
The power and popularity of kernel methods stem in part from their ability to handle diverse forms of structured inputs, including vectors, graphs and strings. Recently, several m...
Darrin P. Lewis, Tony Jebara, William Stafford Nob...