Sciweavers

1258 search results - page 201 / 252
» Architecture-driven Problem Decomposition
Sort
View
CP
2007
Springer
14 years 3 months ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner
GFKL
2007
Springer
163views Data Mining» more  GFKL 2007»
14 years 21 days ago
Fast Support Vector Machine Classification of Very Large Datasets
In many classification applications, Support Vector Machines (SVMs) have proven to be highly performing and easy to handle classifiers with very good generalization abilities. Howe...
Janis Fehr, Karina Zapien Arreola, Hans Burkhardt
JMLR
2008
169views more  JMLR 2008»
13 years 8 months ago
Multi-class Discriminant Kernel Learning via Convex Programming
Regularized kernel discriminant analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. Its performance depends on the selection of kernel...
Jieping Ye, Shuiwang Ji, Jianhui Chen
CG
2005
Springer
13 years 8 months ago
Sketch-based free-form shape modelling with a fast and stable numerical engine
In this paper, we present a feature-based free-form shape modelling technique based on solving a fundamental problem of reconstructing the depth information from 2D sketch planes....
Yong-Jin Liu, Kai Tang, Ajay Joneja
INFOCOM
2010
IEEE
13 years 7 months ago
Utility Maximization for Delay Constrained QoS in Wireless
Abstract—This paper studies the problem of utility maximization for clients with delay based QoS requirements in wireless networks. We adopt a model used in a previous work that ...
I-Hong Hou, P. R. Kumar