Sciweavers

236 search results - page 44 / 48
» A New Neighborhood Based on Improvement Graph for Robust Gra...
Sort
View
ASPDAC
2005
ACM
113views Hardware» more  ASPDAC 2005»
14 years 2 months ago
Scalable interprocedural register allocation for high level synthesis
Abstract— The success of classical high level synthesis has been limited by the complexity of the applications it can handle, typically not large enough to necessitate the depart...
Rami Beidas, Jianwen Zhu
GECCO
2009
Springer
254views Optimization» more  GECCO 2009»
14 years 3 months ago
Agglomerative genetic algorithm for clustering in social networks
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ï¬...
Marek Lipczak, Evangelos E. Milios
DAC
2005
ACM
14 years 9 months ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu
ICCV
2009
IEEE
13 years 6 months ago
Image annotation using multi-label correlated Green's function
Image annotation has been an active research topic in the recent years due to its potentially large impact on both image understanding and web/database image search. In this paper...
Hua Wang, Heng Huang, Chris H. Q. Ding
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 8 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...