Sciweavers

601 search results - page 92 / 121
» CSP(M): Constraint Satisfaction Problem over Models
Sort
View
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 1 months ago
Maximal Intersection Queries in Randomized Input Models
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits...
ATAL
2005
Springer
15 years 7 months ago
Tunably decentralized algorithms for cooperative target observation
Multi-agent problem domains may require distributed algorithms for a variety of reasons: local sensors, limitations of communication, and availability of distributed computational...
Sean Luke, Keith Sullivan, Liviu Panait, Gabriel C...
TSMC
2010
14 years 8 months ago
Probability Density Estimation With Tunable Kernels Using Orthogonal Forward Regression
A generalized or tunable-kernel model is proposed for probability density function estimation based on an orthogonal forward regression procedure. Each stage of the density estimat...
Sheng Chen, Xia Hong, Chris J. Harris
INFOCOM
2007
IEEE
15 years 7 months ago
VoIP on Wireless Meshes: Models, Algorithms and Evaluation
—We study the problem of supporting VoIP calls in a wireless mesh network. Specifically, we propose solutions for call admission control (CAC) and route selection for VoIP calls...
Anand Kashyap, Samrat Ganguly, Samir R. Das, Suman...
ICPR
2002
IEEE
15 years 6 months ago
A Robust Algorithm for Probabilistic Human Recognition From
Human recognition from video requires solving the two tasks, recognition and tracking, simultaneously. This leads to a parameterized time series state space model, representing bo...
Shaohua Kevin Zhou, Rama Chellappa