Sciweavers

6833 search results - page 1359 / 1367
» Some two-character sets
Sort
View
TCS
2010
13 years 5 months ago
A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs
: 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...
Katerina Asdre, Stavros D. Nikolopoulos
TIP
2010
117views more  TIP 2010»
13 years 5 months ago
Multistatic Synthetic Aperture Radar Image Formation
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...
V. Krishnan, J. Swoboda, Can Evren Yarman, Birsen ...
TKDE
2010
182views more  TKDE 2010»
13 years 5 months ago
MILD: Multiple-Instance Learning via Disambiguation
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 ...
Wu-Jun Li, Dit-Yan Yeung
TOMACS
2010
182views more  TOMACS 2010»
13 years 5 months ago
State-dependent importance sampling for a Jackson tandem network
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...
Denis I. Miretskiy, Werner R. W. Scheinhardt, Mich...
COCOA
2010
Springer
13 years 5 months ago
Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives
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...
Peter Damaschke, Azam Sheikh Muhammad
« Prev « First page 1359 / 1367 Last » Next »