Sciweavers

10890 search results - page 1695 / 2178
» Automatic Complexity Analysis
Sort
View
TSP
2010
15 years 1 months ago
Randomized and distributed self-configuration of wireless networks: two-layer Markov random fields and near-optimality
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
Sung-eok Jeon, Chuanyi Ji
ICST
2011
IEEE
14 years 10 months ago
An Empirical Study on the Relation between Dependency Neighborhoods and Failures
—Changing source code in large software systems is complex and requires a good understanding of dependencies between software components. Modification to components with little ...
Thomas Zimmermann, Nachiappan Nagappan, Kim Herzig...
COMPGEOM
2011
ACM
14 years 10 months ago
Deconstructing approximate offsets
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
Eric Berberich, Dan Halperin, Michael Kerber, Roza...
227
Voted
COMPGEOM
2011
ACM
14 years 10 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang
IPSN
2011
Springer
14 years 10 months ago
Localising speech, footsteps and other sounds using resource-constrained devices
While a number of acoustic localisation systems have been proposed over the last few decades, these have typically either relied on expensive dedicated microphone arrays and works...
Yukang Guo, Mike Hazas
« Prev « First page 1695 / 2178 Last » Next »