Sciweavers

3946 search results - page 71 / 790
» The computational complexity of choice sets
Sort
View
PERCOM
2004
ACM
15 years 11 months ago
Models, Protocols, and Architectures for Secure Pervasive Computing: Challenges and Research Directions
We explore the challenges and research directions in building models, protocols and architectures to support security in pervasive computing environments. We argue that to be succ...
Roshan K. Thomas, Ravi S. Sandhu
AIPS
2008
15 years 2 months ago
Scheduling Meetings at Trade Events with Complex Preferences
We present a complex scheduling problem where we want to plan meetings between customers and exhibitors at a trade event. One cause of the complexity of the problem is the general...
Andreas Ernst, Gaurav Singh, René Weiskirch...
CLUSTER
2003
IEEE
15 years 5 months ago
Distributed Recursive Sets: Programmability and Effectiveness for Data Intensive Applications
This paper presents a concurrent object model based on distributed recursive sets for data intensive applications that use complex, recursive data layouts. The set abstraction is ...
Roxana Diaconescu, Reidar Conradi
EDM
2010
129views Data Mining» more  EDM 2010»
15 years 1 months ago
Skill Set Profile Clustering: The Empty K-Means Algorithm with Automatic Specification of Starting Cluster Centers
While students' skill set profiles can be estimated with formal cognitive diagnosis models [8], their computational complexity makes simpler proxy skill estimates attractive [...
Rebecca Nugent, Nema Dean, Elizabeth Ayers
COMPGEOM
2004
ACM
15 years 5 months ago
Inner and outer rounding of set operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
Olivier Devillers, Philippe Guigue