Sciweavers

3946 search results - page 413 / 790
» The computational complexity of choice sets
Sort
View
SLP
1994
77views more  SLP 1994»
15 years 9 months ago
Modal Event Calculus
We consider a hierarchy of modal event calculi to represent and reason about partially ordered events. These calculi are based on the model of time and change of Kowalski and Sergo...
Iliano Cervesato, Luca Chittaro, Angelo Montanari
JMLR
2006
134views more  JMLR 2006»
15 years 7 months ago
Considering Cost Asymmetry in Learning Classifiers
Receiver Operating Characteristic (ROC) curves are a standard way to display the performance of a set of binary classifiers for all feasible ratios of the costs associated with fa...
Francis R. Bach, David Heckerman, Eric Horvitz
WALCOM
2010
IEEE
221views Algorithms» more  WALCOM 2010»
15 years 6 months ago
Variants of Spreading Messages
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...
IPPS
2010
IEEE
15 years 5 months ago
Dynamic analysis of the relay cache-coherence protocol for distributed transactional memory
Transactional memory is an alternative programming model for managing contention in accessing shared in-memory data objects. Distributed transactional memory (TM) promises to alle...
Bo Zhang, Binoy Ravindran
GRAPHICSINTERFACE
2009
15 years 5 months ago
QuickSelect: history-based selection expansion
When editing a graphical document, it is common to apply a change to multiple items at once, and a variety of tools exist for selecting sets of items. However, directly selecting ...
Sara L. Su, Sylvain Paris, Frédo Durand