Sciweavers

1095 search results - page 140 / 219
» Modeling High-Order Dependencies in Local Appearance Models
Sort
View
104
Voted
ECCV
2008
Springer
16 years 6 months ago
Floor Fields for Tracking in High Density Crowd Scenes
Abstract. This paper presents an algorithm for tracking individual targets in high density crowd scenes containing hundreds of people. Tracking in such a scene is extremely challen...
Saad Ali, Mubarak Shah
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
15 years 10 months ago
An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem
An Estimation of Distribution Algorithm (EDA) is proposed to approach the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines in parallel (HFSSDST-UM) proble...
Abdellah Salhi, José Antonio Vázquez...
ICWS
2004
IEEE
15 years 6 months ago
Transforming BPEL into Annotated Deterministic Finite State Automata for Service Discovery
Web services advocate loosely coupled systems, although current loosely coupled applications are limited to stateless services. The reason for this limitation is the lack of a met...
Andreas Wombacher, Peter Fankhauser, Erich J. Neuh...
140
Voted
JSAC
2008
115views more  JSAC 2008»
15 years 4 months ago
A Game-Theoretical Study of Robust Networked Systems
This paper analyses the robustness of networked systems from a game-theoretical perspective. Networked systems often consist of several subsystems sharing resources interdependentl...
Chi-Kin Chau
128
Voted
INFOCOM
2007
IEEE
15 years 11 months ago
Low-Complexity Distributed Scheduling Algorithms for Wireless Networks
— We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules,...
Abhinav Gupta, Xiaojun Lin, R. Srikant