Sciweavers

539 search results - page 89 / 108
» An Improved Upper Bound for SAT
Sort
View
CONSTRAINTS
2011
13 years 4 months ago
A global constraint for total weighted completion time for unary resources
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, we propose an O(n4...
András Kovács, J. Christopher Beck
CVPR
2009
IEEE
15 years 4 months ago
Efficient Kernels for Identifying Unbounded-Order Spatial Features
Higher order spatial features, such as doublets or triplets have been used to incorporate spatial information into the bag-of-local-features model. Due to computational limits, ...
Yimeng Zhang (Carnegie Mellon University), Tsuhan ...
ICCV
2009
IEEE
15 years 1 months ago
Time-Constrained Photography
Capturing multiple photos at different focus settings is a powerful approach for reducing optical blur, but how many photos should we capture within a fixed time budget? We develop...
Samuel W. Hasinoff, Kiriakos N. Kutulakos, Frédo ...
ICML
2007
IEEE
14 years 9 months ago
Asymptotic Bayesian generalization error when training and test distributions are different
In supervised learning, we commonly assume that training and test data are sampled from the same distribution. However, this assumption can be violated in practice and then standa...
Keisuke Yamazaki, Klaus-Robert Müller, Masash...
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
14 years 9 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic