1963 search results - page 233 / 393 » The Maximum Solution Problem on Graphs |
IJRR
2008
15 years 23 days ago
2008
Recognizing useful modular robot configurations composed of hundreds of modules is a significant challenge. Matching a new modular robot configuration to a library of known configu...
98
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
123
Voted
WEA
2010
Springer
15 years 7 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
129
click to vote
ACCV
2010
Springer
14 years 7 months ago
2010
Springer
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
126
click to vote
SIGECOM
2010
ACM
15 years 5 months ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...