Sciweavers

1760 search results - page 190 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
ATAL
2007
Springer
14 years 2 months ago
Distributed task allocation in social networks
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. W...
Mathijs de Weerdt, Yingqian Zhang, Tomas Klos
INFOCOM
2006
IEEE
14 years 2 months ago
Nomadic Service Points
— We consider the novel problem of dynamically assigning application sessions of mobile users or user groups to service points. Such assignments must balance the tradeoff between...
Edward Bortnikov, Israel Cidon, Idit Keidar
IV
1999
IEEE
91views Visualization» more  IV 1999»
14 years 10 days ago
Triangle Mesh Compression for Fast Rendering
Modern GIS(Geographic Information System) application programs and simulation systems have to handle large datasets for rendering. Currently three dimensional rendering hardware a...
Dong-Gyu Park, Yang-Soo Kim, Hwan-Gue Cho
ENDM
2000
174views more  ENDM 2000»
13 years 7 months ago
Hybrid Constraints in Automated Model Synthesis and Model Processing
Both parametric design tasks and analysis tasks of technical systems have a similar problem setting: The structure of the system to be configured or analyzed is defined already. W...
Klaus-Ulrich Leweling, Benno Stein
ICIP
2009
IEEE
13 years 5 months ago
Random swap EM algorithm for finite mixture models in image segmentation
The Expectation-Maximization (EM) algorithm is a popular tool in statistical estimation problems involving incomplete data or in problems which can be posed in a similar form, suc...
Qinpei Zhao, Ville Hautamäki, Ismo Kärkk...