21490 search results - page 4166 / 4298 » Business Process Modeling |
103
click to vote
SPAA
2009
ACM
16 years 2 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
163
Voted
MOBISYS
2009
ACM
16 years 2 months ago
2009
ACM
Top end mobile phones include a number of specialized (e.g., accelerometer, compass, GPS) and general purpose sensors (e.g., microphone, camera) that enable new people-centric sen...
101
Voted
MOBIHOC
2009
ACM
16 years 2 months ago
2009
ACM
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
113
Voted
KDD
2008
ACM
16 years 2 months ago
2008
ACM
This paper addresses the repeated acquisition of labels for data items when the labeling is imperfect. We examine the improvement (or lack thereof) in data quality via repeated la...
137
click to vote
KDD
2007
ACM
16 years 2 months ago
2007
ACM
In some applications such as filling in a customer information form on the web, some missing values may not be explicitly represented as such, but instead appear as potentially va...