Sciweavers

2517 search results - page 55 / 504
» Specifying Weak Sets
Sort
View
TCS
2002
14 years 11 months ago
A truly concurrent semantics for a process algebra using resource pomsets
In this paper we study a process algebra whose semantics is based on true concurrency. In our model, actions are defined in terms of the resources they need to execute, which allo...
Paul Gastin, Michael W. Mislove
ICPR
2006
IEEE
16 years 28 days ago
Ent-Boost: Boosting Using Entropy Measure for Robust Object Detection
Recently, boosting is used widely in object detection applications because of its impressive performance in both speed and accuracy. However, learning weak classifiers which is on...
Duy-Dinh Le, Shin'ichi Satoh
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
AAAI
2006
15 years 1 months ago
Preferences over Sets
Research on preference elicitation and reasoning typically focuses on preferences over single objects of interest. However, in a number of applications the "outcomes" of...
Ronen I. Brafman, Carmel Domshlak, Solomon Eyal Sh...
GRC
2010
IEEE
15 years 28 days ago
Local Pattern Mining from Sequences Using Rough Set Theory
Abstract--Sequential pattern mining is a crucial but challenging task in many applications, e.g., analyzing the behaviors of data in transactions and discovering frequent patterns ...
Ken Kaneiwa, Yasuo Kudo