Sciweavers

1220 search results - page 64 / 244
» Minimal Interval Completions
Sort
View
PICS
2003
13 years 10 months ago
Eye Tracking Observers During Rank Order, Paired Comparison, and Graphical Rating Tasks
In studying image quality and image preference it is necessary to collect psychophysical data. A variety of methods are used to arrive at interval scale values which indicate the ...
Jason S. Babcock, Jeff B. Pelz, Mark D. Fairchild
PR
2008
90views more  PR 2008»
13 years 9 months ago
Fast computation of geometric moments using a symmetric kernel
This paper presents a novel set of geometric moments with symmetric kernel (SGM) obtained using an appropriate transformation of image coordinates. By using this image transformat...
Chong-Yaw Wee, Paramesran Raveendran, R. Mukundan
AMC
2005
138views more  AMC 2005»
13 years 9 months ago
Optimal centers in branch-and-prune algorithms for univariate global optimization
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
D. G. Sotiropoulos, T. N. Grapsa
MICS
2010
102views more  MICS 2010»
13 years 7 months ago
On Conditional Covering Problem
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
Balasubramanian Sivan, S. Harini, C. Pandu Rangan
KR
1998
Springer
14 years 1 months ago
Probabilistic Deduction with Conditional Constraints over Basic Events
We study the problem of probabilistic deduction with conditional constraints over basic events. We show that globallycomplete probabilistic deduction with conditional constraints ...
Thomas Lukasiewicz