9849 search results - page 186 / 1970 » Algorithms and Experiments for the Webgraph |
149
click to vote
IJCAI
2003
15 years 6 months ago
2003
We address the problem of optimally controlling stochastic environments that are partially observable. The standard method for tackling such problems is to define and solve a Part...
127
click to vote
DAC
2007
ACM
16 years 6 months ago
2007
ACM
In this paper, we present a new multi-packing tree (MP-tree) representation for macro placement to handle mixed-size designs. Based on binary trees, the MP-tree is very efficient,...
160
click to vote
TCAD
2008
15 years 4 months ago
2008
In this paper, we present a new multipacking-tree (MP-tree) representation for macro placements to handle modern mixed-size designs with large macros and high chip utilization rate...
171
Voted
WAW
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
164
click to vote
ICCV
2009
IEEE
15 years 2 months ago
2009
IEEE
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...