6833 search results - page 1359 / 1367 » Some two-character sets |
134
click to vote
TCS
2010
15 years 3 days ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
119
click to vote
TIP
2010
15 years 3 days ago
2010
Abstract—In this paper, we consider a multistatic synthetic aperture radar (SAR) imaging scenario where a swarm of airborne antennas, some of which are transmitting, receiving or...
103
click to vote
TKDE
2010
15 years 3 days ago
2010
In multiple-instance learning (MIL), an individual example is called an instance and a bag contains a single or multiple instances. The class labels available in the training set ...
109
click to vote
TOMACS
2010
15 years 3 days ago
2010
This paper considers importance sampling as a tool for rare-event simulation. The focus is on estimating the probability of overflow in the downstream queue of a Jacksonian two-n...
125
click to vote
COCOA
2010
Springer
14 years 11 months ago
2010
Springer
The classical and well-studied group testing problem is to find d defectives in a set of n elements by group tests, which tell us for any chosen subset whether it contains defectiv...