7015 search results - page 1092 / 1403 » Approximation algorithms for co-clustering |
127
Voted
IROS
2009
IEEE
15 years 11 months ago
2009
IEEE
— This paper describes an algorithm for estimating lane boundaries and curbs from a moving vehicle using noisy observations and a probabilistic model of curvature. The primary co...
137
Voted
AAIM
2009
Springer
15 years 11 months ago
2009
Springer
This paper studies the aggregation of messages in networks that consist of a chain of nodes, and each message is time-constrained such that it needs to be aggregated during a give...
153
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
118
click to vote
WG
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
138
click to vote
WIA
2009
Springer
15 years 11 months ago
2009
Springer
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...