Sciweavers

405 search results - page 69 / 81
» Using critical sets to solve the maximum independent set pro...
Sort
View
SPAA
2009
ACM
14 years 2 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
AIEDU
2005
144views more  AIEDU 2005»
13 years 7 months ago
An Algebra Subsystem for Diagnosing Students' Input in a Physics Tutoring System
To help a student in an introductory physics course do quantitative homework problems, an intelligent tutoring system must determine information of an algebraic nature. This paper...
Joel A. Shapiro
SIGECOM
2009
ACM
108views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
Selling ad campaigns: online algorithms with cancellations
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
Moshe Babaioff, Jason D. Hartline, Robert D. Klein...
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 3 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
SMC
2007
IEEE
156views Control Systems» more  SMC 2007»
14 years 1 months ago
Dynamic fusion of classifiers for fault diagnosis
—This paper considers the problem of temporally fusing classifier outputs to improve the overall diagnostic classification accuracy in safety-critical systems. Here, we discuss d...
Satnam Singh, Kihoon Choi, Anuradha Kodali, Krishn...