Sciweavers

195 search results - page 38 / 39
» A polynomial algorithm for the p-centdian problem on a tree
Sort
View
CORR
2010
Springer
100views Education» more  CORR 2010»
13 years 6 months ago
Secret Key Generation for a Pairwise Independent Network Model
Abstract— We investigate secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources which are independent o...
Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Pr...
CVIU
2011
12 years 11 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...
PODS
2009
ACM
136views Database» more  PODS 2009»
14 years 8 months ago
Distributed XML design
A distributed XML document is an XML document that spans several machines or Web repositories. We assume that a distribution design of the document tree is given, providing an XML...
Serge Abiteboul, Georg Gottlob, Marco Manna
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
14 years 15 days ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
RTSS
1992
IEEE
13 years 11 months ago
Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
Chao-Ju Hou, Kang G. Shin