Sciweavers

393 search results - page 72 / 79
» Convex Programming Methods for Global Optimization
Sort
View
IJHPCA
2007
116views more  IJHPCA 2007»
13 years 7 months ago
Parallel Languages and Compilers: Perspective From the Titanium Experience
We describe the rationale behind the design of key features of Titanium—an explicitly parallel dialect of JavaTM for high-performance scientific programming—and our experienc...
Katherine A. Yelick, Paul N. Hilfinger, Susan L. G...
JMLR
2008
168views more  JMLR 2008»
13 years 7 months ago
Max-margin Classification of Data with Absent Features
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...
CVPR
2008
IEEE
14 years 9 months ago
Probabilistic graph and hypergraph matching
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
Ron Zass, Amnon Shashua
IJCNN
2007
IEEE
14 years 1 months ago
Agnostic Learning versus Prior Knowledge in the Design of Kernel Machines
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
Gavin C. Cawley, Nicola L. C. Talbot
IMR
2004
Springer
14 years 26 days ago
3D Hybrid Mesh Generation for Reservoir Flow Simulation
A great challenge for flow simulators of new generation is to gain more accuracy at well proximity within complex geological structures. For this purpose, a new approach based on...
N. Flandrin, Houman Borouchaki, Chakib Bennis