1871 search results - page 50 / 375 » The Ephemeral Pairing Problem |
FOCS
1999
IEEE
15 years 3 months ago
1999
IEEE
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...
STOC
2009
ACM
15 years 11 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
78
Voted
ICPR
2008
IEEE
15 years 5 months ago
2008
IEEE
Under the homoscedastic Gaussian assumption, it has been shown that Fisher’s linear discriminant analysis (FLDA) suffers from the class separation problem when the dimensionalit...
WAOA
2005
Springer
15 years 4 months ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
ISAAC
2004
Springer
15 years 4 months ago
2004
Springer
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...