Sciweavers

308 search results - page 3 / 62
» A new enhanced constructive decomposition and mapping algori...
Sort
View
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
14 years 13 days ago
Finding Branch-Decompositions and Rank-Decompositions
Abstract. We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid rep...
Petr Hlinený, Sang-il Oum
INFOCOM
2012
IEEE
11 years 8 months ago
Approximate convex decomposition based localization in wireless sensor networks
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
Wenping Liu, Dan Wang, Hongbo Jiang, Wenyu Liu, Ch...
CC
2007
Springer
208views System Software» more  CC 2007»
14 years 14 days ago
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
Bernhard Scholz, Johann Blieberger
IMR
2004
Springer
13 years 11 months ago
Watertight Anisotropic Surface Meshing Using Quadrilateral Patches
This paper presents a simple technique for generating anisotropic surface triangulations using a generic unstructured quadrilateral decomposition of CAD entities that map to a log...
Robert Haimes, Michael J. Aftosmis
TCC
2012
Springer
218views Cryptology» more  TCC 2012»
12 years 1 months ago
Iterative Constructions and Private Data Release
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
Anupam Gupta, Aaron Roth, Jonathan Ullman