Sciweavers

1161 search results - page 87 / 233
» Approximation schemes for clustering problems
Sort
View
ICIAR
2005
Springer
15 years 5 months ago
Real-Time and Robust Background Updating for Video Surveillance and Monitoring
Abstract. Background updating is an important aspect of dynamic scene analysis. Two critical problems: sudden camera perturbation and the sleeping person problem, which arise frequ...
Xingzhi Luo, Suchendra M. Bhandarkar
TNN
2008
119views more  TNN 2008»
14 years 11 months ago
Selecting Useful Groups of Features in a Connectionist Framework
Abstract--Suppose for a given classification or function approximation (FA) problem data are collected using sensors. From the output of the th sensor, features are extracted, ther...
Debrup Chakraborty, Nikhil R. Pal
SODA
1998
ACM
106views Algorithms» more  SODA 1998»
15 years 1 months ago
Greedy Strikes Back: Improved Facility Location Algorithms
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
Sudipto Guha, Samir Khuller
ICC
2008
IEEE
167views Communications» more  ICC 2008»
15 years 6 months ago
Clustering Large Optical Networks for Distributed and Dynamic Multicast
—For a large-scale mesh network with dynamic traffic, maintaining the global state information in a centralized fashion is impractical. Hence, distributed schemes are needed to ...
Mohammad Masud Hasan, Jason P. Jue
ICDCSW
2005
IEEE
15 years 5 months ago
Bandwidth Clustering for Reliable and Prioritized Network Routing Using Split Agent-Based Method
Recent researches have highlighted the importance of developing a network with distributed problem solving abilities thus enhancing reliability with equal share of network resourc...
Constandinos X. Mavromoustakis, Helen D. Karatza