1096 search results - page 82 / 220 » A New Approach for Speeding Up Enumeration Algorithms |
160
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
155
click to vote
ICCD
2007
IEEE
16 years 3 months ago
2007
IEEE
We have developed a new statistical timing analysis approach that does not impose any assumptions on the nature of manufacturing variability and takes into account an arbitrary mo...
211
click to vote
ANTSW
2004
Springer
15 years 10 months ago
2004
Springer
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
179
click to vote
JPDC
2008
15 years 6 months ago
2008
This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achieves high speed by efficiently utilizing the parallelism of the GPU throughout th...
199
click to vote
EUROPAR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Point matching is crucial for many computer vision applications. Establishing the correspondence between a large number of data points is a computationally intensive proc...