1165 search results - page 71 / 233 » Effective linear programming based placement methods |
124
Voted
ICARCV
2008
IEEE
15 years 9 months ago
2008
IEEE
— We consider a discrete-time dynamical system with Boolean and continuous states, with the continuous state propagating linearly in the continuous and Boolean state variables, a...
124
click to vote
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
Interactions between agents in an open system such as the Internet require a significant degree of flexibility. A crucial aspect of the development of such methods is the notion o...
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An S...
142
Voted
CVPR
2006
IEEE
16 years 4 months ago
2006
IEEE
We consider the general problem of learning from both labeled and unlabeled data. Given a set of data points, only a few of them are labeled, and the remaining points are unlabele...
110
click to vote
GD
2005
Springer
15 years 8 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...