Sciweavers

248 search results - page 10 / 50
» The Multi-Story Space Assignment Problem
Sort
View
AAAI
2008
14 years 4 days ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
TKDE
2008
118views more  TKDE 2008»
13 years 9 months ago
A Lagrangian Approach for Multiple Personalized Campaigns
The multicampaign assignment problem is a campaign model to overcome the multiple-recommendation problem that occurs when conducting several personalized campaigns simultaneously. ...
Yong-Hyuk Kim, Yourim Yoon, Byung Ro Moon
IJNSEC
2007
131views more  IJNSEC 2007»
13 years 9 months ago
An Asymmetric Cryptographic Key Assignment Scheme for Access Control in Tree Structural Hierarchies
In a hierarchical structure, a user in a security class has access to information items of another class if and only if the former class is a predecessor of latter. Based upon cry...
Debasis Giri, Parmeshwary Dayal Srivastava
GI
2005
Springer
14 years 3 months ago
On the Signaling Overhead in Dynamic OFDMA Wireless Systems
: It is well known that dynamic OFDMA systems potentially increase the spectral efficiency of wireless systems. They exploit diversity effects in time, space, and frequency by ass...
James Gross, Adam Wolisz, Hans-Florian Geerdes
ICIP
2005
IEEE
14 years 11 months ago
Shape space sampling distributions and their impact on visual tracking
Object motions can be represented as a sequence of shape deformations and translations which can be interpretated as a sequence of points in N-dimensional shape space. These space...
Amit Kale, Christopher O. Jaynes