Sciweavers

1576 search results - page 56 / 316
» Streaming Algorithms for Independent Sets
Sort
View
ICDCS
2008
IEEE
15 years 4 months ago
Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
Kai Xing, Wei Cheng, E. K. Park, Shmuel Rotenstrei...
WAOA
2005
Springer
86views Algorithms» more  WAOA 2005»
15 years 3 months ago
SONET ADMs Minimization with Divisible Paths
We consider an optical routing problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic...
Leah Epstein, Asaf Levin
WEA
2010
Springer
300views Algorithms» more  WEA 2010»
15 years 4 months ago
Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
Charles Delort, Olivier Spanjaard
SSPR
2004
Springer
15 years 3 months ago
An Optimal Probabilistic Graphical Model for Point Set Matching
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
Tibério S. Caetano, Terry Caelli, Dante Aug...
COOPIS
1999
IEEE
15 years 2 months ago
Using Fagin's Algorithm for Merging Ranked Results in Multimedia Middleware
A distributed multimedia information system allows users to access data of different modalities, from different data sources, ranked by various combinationsof criteria. In [6], Fa...
Edward L. Wimmers, Laura M. Haas, Mary Tork Roth, ...