417 search results - page 50 / 84 » Generalization Bounds for Some Ordinal Regression Algorithms |
143
Voted
ATVA
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
205
click to vote
TASE
2010
IEEE
15 years 8 days ago
2010
IEEE
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...
141
click to vote
JSYML
2010
15 years 10 days ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
180
click to vote
KDD
2012
ACM
13 years 8 months ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
171
click to vote
WWW
2006
ACM
16 years 6 months ago
2006
ACM
Large-scale text categorization is an important research topic for Web data mining. One of the challenges in large-scale text categorization is how to reduce the amount of human e...