Sciweavers

1082 search results - page 80 / 217
» Approximation Algorithms for Spreading Points
Sort
View
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
14 years 2 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
EUROSSC
2007
Springer
14 years 1 months ago
Sensing Motion Using Spectral and Spatial Analysis of WLAN RSSI
In this paper we present how motion sensing can be obtained just by observing the WLAN radio signal strength and its fluctuations. The temporal, spectral and spatial characteristi...
Kavitha Muthukrishnan, Maria Eva Lijding, Nirvana ...
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
13 years 9 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz
EC
2002
180views ECommerce» more  EC 2002»
13 years 7 months ago
Combining Convergence and Diversity in Evolutionary Multiobjective Optimization
Over the past few years, the research on evolutionary algorithms has demonstrated their niche in solving multiobjective optimization problems, where the goal is to nd a number of ...
Marco Laumanns, Lothar Thiele, Kalyanmoy Deb, Ecka...
ICALP
2010
Springer
14 years 16 days ago
Clustering with Diversity
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
Jian Li, Ke Yi, Qin Zhang