Sciweavers

1214 search results - page 114 / 243
» Labeling Points with Weights
Sort
View
98
Voted
ALT
1998
Springer
15 years 5 months ago
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
Valery N. Shevchenko, Nikolai Yu. Zolotykh
92
Voted
FATES
2006
Springer
15 years 4 months ago
A Symbolic Framework for Model-Based Testing
Abstract. The starting point for Model-Based Testing is an implementation relation that formally defines when a formal model representing the System Under Test conforms to a formal...
Lars Frantzen, Jan Tretmans, Tim A. C. Willemse
AAAI
2008
15 years 3 months ago
Semi-supervised Classification Using Local and Global Regularization
In this paper, we propose a semi-supervised learning (SSL) algorithm based on local and global regularization. In the local regularization part, our algorithm constructs a regular...
Fei Wang, Tao Li, Gang Wang, Changshui Zhang
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
13 years 3 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
80
Voted
ICML
2005
IEEE
16 years 1 months ago
Action respecting embedding
Dimensionality reduction is the problem of finding a low-dimensional representation of highdimensional input data. This paper examines the case where additional information is kno...
Michael H. Bowling, Ali Ghodsi, Dana F. Wilkinson