4451 search results - page 283 / 891 » On Random Ordering Constraints |
171
click to vote
NETWORKS
2008
15 years 6 months ago
2008
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
220
click to vote
IJCV
2008
15 years 6 months ago
2008
Image segmentation algorithms partition the set of pixels of an image into a specific number of different, spatially homogeneous groups. We propose a nonparametric Bayesian model f...
215
click to vote
EMMCVPR
2011
Springer
14 years 6 months ago
2011
Springer
Traditional approaches to Multiple-Instance Learning (MIL) operate under the assumption that the instances of a bag are generated independently, and therefore typically learn an in...
191
click to vote
TCS
2012
14 years 2 months ago
2012
In Sensor Networks, the lack of topology information and the availability of only one communication channel has led research work to the use of randomization to deal with collisio...
185
click to vote
JAR
2006
15 years 6 months ago
2006
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...