Sciweavers

2254 search results - page 149 / 451
» Computing the minimal covering set
Sort
View
ICPR
2008
IEEE
16 years 1 months ago
Detecting hubs and quasi cliques in scale-free networks
Scale-free networks are believed to closely model most real-world networks. An interesting property of such networks is the existence of so-called hub and community structures. In...
Sriganesh Srihari, Hoong Kee Ng, Kang Ning, Hon Wa...
ICDCSW
2007
IEEE
16 years 27 days ago
Modeling Data Consistency in Wireless Sensor Networks
— With the rapid growth of wireless sensor systems deployment, data quality has become a critical issue to the success of these applications. In this paper, we first raise the d...
Kewei Sha, Weisong Shi
GI
2007
Springer
16 years 22 days ago
Classification of Vegetation Fusing Multichannel SAR Data by a Fuzzy Approach
: The improved spatial resolution of modern SAR sensors allows the distinction of significant areas in rural as well as in urban environments. For this purpose additional informati...
Antje Thiele, Karsten Schulz, Ulrich Thoennessen, ...
FOCS
2006
IEEE
16 years 19 days ago
Improved approximation algorithms for multidimensional bin packing problems
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
Nikhil Bansal, Alberto Caprara, Maxim Sviridenko
ECOOPW
2000
Springer
15 years 11 months ago
New Issues in Object Interoperability
This report summarizes the presentations, discussions, and outcomes of the ECOOP’2000 Workshop on Object Interoperability, held in Sophia Antipolis, France, on Monday, June 12, 2...
Antonio Vallecillo, Juan Hernández Nú...