8431 search results - page 65 / 1687 » Algorithmically Independent Sequences |
117
click to vote
DCOSS
2008
Springer
14 years 11 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
CEC
2010
IEEE
14 years 4 months ago
2010
IEEE
We study the problem of efficiently allocating incoming independent tasks onto the resources of a Grid system. Typically, it is assumed that the estimated time to compute each task...
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we present a new algorithm for solving the block matching problem which is independent of image content and is faster than other full-search methods. The method emp...
DAC
1998
ACM
15 years 10 months ago
1998
ACM
The logic blocks CLBs of a lookup table LUT based FPGA consist of one or more LUTs, possibly of di erent sizes. In this paper, we focus on technology mapping for CLBs with several...
100
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...