230 search results - page 44 / 46 » Minimum Spanning Tree Problem with Label Selection |
FOCS
2004
IEEE
14 years 14 days ago
2004
IEEE
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...
EMNLP
2007
13 years 10 months ago
2007
In Sequential Viterbi Models, such as HMMs, MEMMs, and Linear Chain CRFs, the type of patterns over output sequences that can be learned by the model depend directly on the modelâ...
BMVC
2010
13 years 6 months ago
2010
We present a framework for the reduction of dimensionality of a data set via manifold learning. Using the building blocks of local hyperplanes we show how a global manifold can be...
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
JACM
2000
13 years 8 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...