170 search results - page 5 / 34 » On Metro-Line Crossing Minimization |
CICLING
2011
Springer
12 years 11 months ago
2011
Springer
This paper proposes an approach of extracting simple and effective features that enhances multilingual document ranking (MLDR). There is limited prior research on capturing the co...
GD
2003
Springer
14 years 17 days ago
2003
Springer
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...
ICASSP
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper introduces a novel energy minimization method, namely iterated cross entropy with partition strategy (ICEPS), into the Markov random field theory. The solver, which is...
TMM
2011
13 years 2 months ago
2011
—In this paper, we propose an approach to manage network resources for a direct sequence code division multiple access (DS-CDMA) visual sensor network where nodes monitor scenes ...
NIPS
2004
13 years 8 months ago
2004
We propose to selectively remove examples from the training set using probabilistic estimates related to editing algorithms (Devijver and Kittler, 1982). This heuristic procedure ...