2638 search results - page 122 / 528 » Random Geometric Complexes |
142
click to vote
AAAI
2007
15 years 7 months ago
2007
String kernels directly model sequence similarities without the necessity of extracting numerical features in a vector space. Since they better capture complex traits in the seque...
154
click to vote
ITC
1996
IEEE
15 years 8 months ago
1996
IEEE
Abstract. In complex systems, embedded processors may be used to run software routines for test pattern generation and response evaluation. For system components which are not comp...
162
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
130
click to vote
PAKDD
2010
ACM
15 years 9 months ago
2010
ACM
We present a novel graph ranking model to extract a diverse set of answers for complex questions via random walks over a negative-edge graph. We assign a negative sign to edge weig...
125
click to vote
STOC
1996
ACM
15 years 8 months ago
1996
ACM
The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = n i=1 mk i . We consider the space complexity of randomized algorithms that...