Sciweavers

4354 search results - page 770 / 871
» Classification-based objective functions
Sort
View
163
Voted
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
15 years 6 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
138
Voted
IADIS
2004
15 years 6 months ago
The Intercollege Student Intranet
In this paper we present the Intercollege Intranet, which has been developed within the strategic aims of the College to offer better services to students and faculty and to enhan...
Philippos Pouyioutas, Maria Poveda, George Soleas,...
DC
2001
15 years 6 months ago
Metadata Interoperability and Meta-search on the Web
Several initiatives for establishing standards for metadata models are being carried out at the moment, but everyone focuses on their own requirements when defining metadata attri...
Enric Peig, Jaime Delgado, Ismael Pérez
NIPS
2003
15 years 6 months ago
Max-Margin Markov Networks
In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the ...
Benjamin Taskar, Carlos Guestrin, Daphne Koller
WSC
2000
15 years 6 months ago
Circumstance descriptors: a method for generating plan modifications and fragmentary orders
Circumstance Descriptors are offered as a way to organize spatial and other military knowledge that may be difficult to formulate, particularly the kinds of details that are most ...
John B. Gilmer Jr.