Sciweavers

321 search results - page 16 / 65
» Enabling local computation for partially ordered preferences
Sort
View
COLCOM
2008
IEEE
14 years 2 months ago
A Constraint and Attribute Based Security Framework for Dynamic Role Assignment in Collaborative Environments
Abstract. We investigate a security framework for collaborative applications that relies on the role-based access control (RBAC) model. In our framework, roles are pre-defined and...
Isabel F. Cruz, Rigel Gjomemo, Benjamin Lin, Mirko...
MEMOCODE
2008
IEEE
14 years 1 months ago
Virtual prototyping AADL architectures in a polychronous model of computation
While synchrony and asynchrony are two distinct concepts of concurrency theory, effective and formally defined embedded system design methodologies usually mix the best from both...
Ma Yue, Jean-Pierre Talpin, Thierry Gautier
ECCV
2010
Springer
14 years 1 days ago
Partition Min-Hash for Partial Duplicate Image Discovery
In this paper, we propose Partition min-Hash (PmH), a novel hashing scheme for discovering partial duplicate images from a large database. Unlike the standard min-Hash algorithm th...
JCSS
2010
112views more  JCSS 2010»
13 years 6 months ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn
ECAI
2010
Springer
13 years 6 months ago
Local search algorithms on the Stable Marriage Problem: Experimental Studies
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...