2150 search results - page 226 / 430 » On a restricted cross-intersection problem |
143
click to vote
EMSOFT
2009
Springer
15 years 7 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
139
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
176
click to vote
SIAMCOMP
2008
15 years 2 months ago
2008
Abstract. To cope with the impossibility of solving agreement problems in asynchronous systems made up of n processes and prone to t process crashes, system designers tailor their ...
150
Voted
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
This paper presents GeoS, a new algorithm for the efficient segmentation of n-dimensional image and video data. The segmentation problem is cast as approximate energy minimization ...
153
click to vote
ECCV
2006
Springer
16 years 5 months ago
2006
Springer
Many linear discriminant analysis (LDA) and kernel Fisher discriminant analysis (KFD) methods are based on the restrictive assumption that the data are homoscedastic. In this paper...