Sciweavers

11 search results - page 2 / 3
» Speeding up SVM Decision Based on Mirror Points
Sort
View
GECCO
2010
Springer
184views Optimization» more  GECCO 2010»
13 years 8 months ago
A mono surrogate for multiobjective optimization
Most surrogate approaches to multi-objective optimization build a surrogate model for each objective. These surrogates can be used inside a classical Evolutionary Multiobjective O...
Ilya Loshchilov, Marc Schoenauer, Michèle S...
ACL
2011
12 years 9 months ago
Joint Training of Dependency Parsing Filters through Latent Support Vector Machines
Graph-based dependency parsing can be sped up significantly if implausible arcs are eliminated from the search-space before parsing begins. State-of-the-art methods for arc filt...
Colin Cherry, Shane Bergsma
CI
2011
93views more  CI 2011»
13 years 12 days ago
Supporting clinical processes and decisions by hierarchical planning and scheduling
This paper is focused on how a general-purpose hierarchical planning representation, based on the HTN paradigm, can be used to support the representation of oncology treatment pro...
Juan Fernández-Olivares, Luis A. Castillo, ...
DAC
1999
ACM
13 years 9 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther
EDBT
2008
ACM
180views Database» more  EDBT 2008»
14 years 5 months ago
Probabilistic ranked queries in uncertain databases
Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to "certain" data, ...
Xiang Lian, Lei Chen 0002