Sciweavers

11151 search results - page 384 / 2231
» On the Complexity of Model Expansion
Sort
View
ICC
2008
IEEE
109views Communications» more  ICC 2008»
16 years 2 months ago
Wireless Scheduling Algorithms with O(1) Overhead for M-Hop Interference Model
Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...
Yung Yi, Mung Chiang
CAIP
2007
Springer
217views Image Analysis» more  CAIP 2007»
16 years 1 months ago
Mixture Models Based Background Subtraction for Video Surveillance Applications
— Background subtraction is a method commonly used to segment objects of interest in image sequences. By comparing new frames to a background model, regions of interest can be fo...
Chris Poppe, Gaëtan Martens, Peter Lambert, R...
EJC
2000
15 years 9 months ago
A Communicating Tree Model for Generating Network Applications
We present a new model for generating network applications. Our model is based on trees communicating with each other. Our model is simple to understand, but yet powerful enough to...
Tomohiro Matsuzaki, Takehiro Tokuda
ACL
1992
15 years 8 months ago
Modeling Negotiation Subdialogues
This paper presents a plan-based model that handles negotiation subdialogues by inferring both the communicative actions that people pursue when speaking and the beliefs underlyin...
Lynn Lambert, Sandra Carberry
CGF
2000
197views more  CGF 2000»
15 years 7 months ago
Modelling Virtual Cities Dedicated to Behavioural Animation
In order to populate virtual cities, it is necessary to specify the behaviour of dynamic entities such as pedestrians or car drivers. Since a complete mental model based on vision...
Gwenola Thomas, Stéphane Donikian