Sciweavers

2463 search results - page 63 / 493
» Rankings of Directed Graphs
Sort
View
FOCS
1999
IEEE
15 years 4 months ago
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
Jon Feldman, Matthias Ruhl
DSP
2007
14 years 11 months ago
Performance comparison between statistical-based and direct data domain STAPs
In the situation that a radar platform is moving very fast, the number of training data used in space-time adaptive processing (STAP) is a major concern. Less number of training d...
Santana Burintramart, Tapan K. Sarkar, Yu Zhang, M...
EMNLP
2008
15 years 1 months ago
Ranking Reader Emotions Using Pairwise Loss Minimization and Emotional Distribution Regression
This paper presents two approaches to ranking reader emotions of documents. Past studies assign a document to a single emotion category, so their methods cannot be applied directl...
Kevin Hsin-Yih Lin, Hsin-Hsi Chen
ERCIMDL
2003
Springer
145views Education» more  ERCIMDL 2003»
15 years 5 months ago
Reference Directed Indexing: Redeeming Relevance for Subject Search in Citation Indexes
Abstract. Citation indexes are valuable tools for research, in part because they provide a means with which to measure the relative impact of articles in a collection of scientifi...
Shannon Bradshaw
ECCV
2006
Springer
15 years 3 months ago
Direct Segmentation of Multiple 2-D Motion Models of Different Types
We propose a closed form solution for segmenting mixtures of 2-D translational and 2-D affine motion models directly from the image intensities. Our approach exploits the fact that...
Dheeraj Singaraju, René Vidal