Sciweavers

78 search results - page 15 / 16
» Decision methods for linearly ordered Heyting algebras
Sort
View
IPL
2010
114views more  IPL 2010»
14 years 8 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
DGO
2007
133views Education» more  DGO 2007»
14 years 11 months ago
A toolbox for the choice of indicator classes for ranking of watersheds
There has been considerable work on determining a suitable method to accomplish a satisfactory ordering of a group of objects, when there are multiple evaluation criteria. A weigh...
K. Sham Bhat
91
Voted
JMLR
2002
89views more  JMLR 2002»
14 years 9 months ago
A Robust Minimax Approach to Classification
When constructing a classifier, the probability of correct classification of future data points should be maximized. We consider a binary classification problem where the mean and...
Gert R. G. Lanckriet, Laurent El Ghaoui, Chiranjib...
TASE
2010
IEEE
14 years 4 months ago
Robust Calibration for Localization in Clustered Wireless Sensor Networks
This paper presents a robust calibration procedure for clustered wireless sensor networks. Accurate calibration of between-node distances is one crucial step in localizing sensor n...
Jung Jin Cho, Yu Ding, Yong Chen, Jiong Tang
91
Voted
TKDE
2010
274views more  TKDE 2010»
14 years 8 months ago
Ranked Query Processing in Uncertain Databases
—Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to “certain” data, the ...
Xiang Lian, Lei Chen 0002