230 search results - page 37 / 46 » Minimum Spanning Tree Problem with Label Selection |
FOCS
1992
IEEE
14 years 24 days ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
ETRA
2010
ACM
13 years 9 months ago
2010
ACM
This paper presents a set of qualitative and quantitative scores designed to assess performance of any eye movement classification algorithm. The scores are designed to provide a ...
CAAN
2006
Springer
14 years 13 days ago
2006
Springer
We consider the problem of finding a short path between any two nodes of a network when no global information is available, nor any oracle to help in routing. A mobile agent, situa...
NIPS
2001
13 years 10 months ago
2001
This paper presents a novel approach to the unsupervised learning of syntactic analyses of natural language text. Most previous work has focused on maximizing likelihood according...
VLDB
1998
ACM
14 years 28 days ago
1998
ACM
Classification is an important problem in data mining. Given a database of records, each with a class label, a classifier generates a concise and meaningful description for each c...