837 search results - page 78 / 168 » Hard combinators |
PAKM
2008
15 years 1 months ago
2008
With a rich variety of forms and types, digital resources are complex data objects. They grows fast in volume on the Web, but hard to be classified efficiently. The paper presents ...
124
click to vote
MLMTA
2007
15 years 1 months ago
2007
— Cluster Ensembles is a framework for combining multiple partitionings obtained from separate clustering runs into a final consensus clustering. This framework has attracted mu...
136
click to vote
NIPS
2007
15 years 1 months ago
2007
In online handwriting recognition the trajectory of the pen is recorded during writing. Although the trajectory provides a compact and complete representation of the written outpu...
NIPS
2007
15 years 1 months ago
2007
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...
FLAIRS
2004
15 years 1 months ago
2004
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...