2030 search results - page 159 / 406 » Extremal Problems of Information Combining |
141
click to vote
DATAMINE
2007
15 years 6 months ago
2007
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...
177
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
We consider the problem of stabilizing a plant with a network of resource constrained wireless nodes. In a companion paper, we developed a protocol where each node repeatedly trans...
166
click to vote
FLAIRS
2009
15 years 4 months ago
2009
In our experiments with four well-known systems for solving partially observable planning problems (Contingent-FF, MBP, PKS, and POND), we were greatly surprised to find that they...
147
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Active learning algorithms attempt to accelerate the learning process by requesting labels for the most informative items first. In real-world problems, however, there ma...
257
click to vote
CISS
2011
IEEE
14 years 10 months ago
2011
IEEE
—We consider a multi-static radar scenario with spatially dislocated receivers that can individually extract delay information only. Furthermore, we assume that the receivers are...