Sciweavers

2694 search results - page 37 / 539
» Fully Distributed Algorithms for Convex Optimization Problem...
Sort
View
120
Voted
OL
2011
190views Neural Networks» more  OL 2011»
14 years 4 months ago
On optimality of a polynomial algorithm for random linear multidimensional assignment problem
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
Pavlo A. Krokhmal
ECCV
2010
Springer
14 years 10 months ago
Fast Optimization for Mixture Prior Models
Abstract. We consider the minimization of a smooth convex function regularized by the mixture of prior models. This problem is generally difficult to solve even each simpler regula...
Junzhou Huang, Shaoting Zhang, Dimitris N. Metaxas
ICST
2009
IEEE
15 years 4 months ago
Optimizing Probabilities of Real-Time Test Case Execution
—Model-based test derivation for real-time system has been proven to be a hard problem for exhaustive test suites. Therefore, techniques for real-time testing do not aim to exhau...
Nicolás Wolovick, Pedro R. D'Argenio, Hongy...
WADS
1997
Springer
108views Algorithms» more  WADS 1997»
15 years 1 months ago
Dynamic Data Structures for Fat Objects and Their Applications
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha ...
JMLR
2006
124views more  JMLR 2006»
14 years 9 months ago
A Direct Method for Building Sparse Kernel Learning Algorithms
Many kernel learning algorithms, including support vector machines, result in a kernel machine, such as a kernel classifier, whose key component is a weight vector in a feature sp...
Mingrui Wu, Bernhard Schölkopf, Gökhan H...