Sciweavers

973 search results - page 105 / 195
» New Bounds on Crossing Numbers
Sort
View
PRL
2008
133views more  PRL 2008»
15 years 6 months ago
Better multiclass classification via a margin-optimized single binary problem
We develop a new multiclass classification method that reduces the multiclass problem to a single binary classifier (SBC). Our method constructs the binary problem by embedding sm...
Ran El-Yaniv, Dmitry Pechyony, Elad Yom-Tov
ATMOS
2010
308views Optimization» more  ATMOS 2010»
15 years 5 months ago
The Team Orienteering Problem: Formulations and Branch-Cut and Price
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
Marcus Poggi de Aragão, Henrique Viana, Edu...
PVM
2010
Springer
15 years 4 months ago
MPI Datatype Marshalling: A Case Study in Datatype Equivalence
MPI datatypes are a convenient abstraction for manipulating complex data structures and are useful in a number of contexts. In some cases, these descriptions need to be preserved o...
Dries Kimpe, David Goodell, Robert B. Ross
FOCS
2009
IEEE
16 years 1 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
DIS
2006
Springer
15 years 10 months ago
Incremental Algorithm Driven by Error Margins
Incremental learning is an approach to deal with the classification task when datasets are too large or when new examples can arrive at any time. One possible approach uses concent...
Gonzalo Ramos-Jiménez, José del Camp...