Sciweavers

7519 search results - page 1216 / 1504
» Optimizing Generic Functions
Sort
View
ESANN
2004
15 years 8 months ago
Sparse LS-SVMs using additive regularization with a penalized validation criterion
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
15 years 6 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang
AI
2010
Springer
15 years 6 months ago
Automatically generating personalized user interfaces with Supple
Today's computer-human interfaces are typically designed with the assumption that they are going to be used by an able-bodied person, who is using a typical set of input and ...
Krzysztof Z. Gajos, Daniel S. Weld, Jacob O. Wobbr...
AI
2008
Springer
15 years 6 months ago
An approach to efficient planning with numerical fluents and multi-criteria plan quality
Dealing with numerical information is practically important in many real-world planning domains where the executability of an action can depend on certain numerical conditions, an...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
ECCC
2006
134views more  ECCC 2006»
15 years 6 months ago
Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...
Avi Wigderson, David Xiao
« Prev « First page 1216 / 1504 Last » Next »