3823 search results - page 296 / 765 » Experiments with Random Projection |
150
click to vote
NIPS
2001
15 years 6 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
144
click to vote
TREC
2004
15 years 6 months ago
2004
Our participation in TREC 2004 aims to extend and improve the use of the DFR (Divergence From Randomness) models with Query Expansion (QE) for the robust track. We experiment with...
138
click to vote
WCE
2007
15 years 6 months ago
2007
— The rapid transit network design problem considers at upper level the list of potential transit corridors and stations to design the network as a discrete space of alternatives...
128
Voted
AAI
2010
15 years 5 months ago
2010
We discuss issues in designing virtual humans for applications which require long-term voluntary use, and the problem of maintaining engagement with users over time. Concepts and t...
142
click to vote
DAM
2008
15 years 4 months ago
2008
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...