Sciweavers

308 search results - page 31 / 62
» A new enhanced constructive decomposition and mapping algori...
Sort
View
SIAMJO
2008
93views more  SIAMJO 2008»
15 years 3 months ago
Stochastic Programs with First-Order Dominance Constraints Induced by Mixed-Integer Linear Recourse
We propose a new class of stochastic integer programs whose special features are dominance constraints induced by mixed-integer linear recourse. For these models, we establish clo...
Ralf Gollmer, Frederike Neise, Rüdiger Schult...
161
Voted
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
15 years 9 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
AAAI
2011
14 years 3 months ago
Transfer Learning by Structural Analogy
Transfer learning allows knowledge to be extracted from auxiliary domains and be used to enhance learning in a target domain. For transfer learning to be successful, it is critica...
Hua-Yan Wang, Qiang Yang
IPMI
2005
Springer
15 years 9 months ago
Robust Nonrigid Multimodal Image Registration Using Local Frequency Maps
Automatic multi-modal image registration is central to numerous tasks in medical imaging today and has a vast range of applications e.g., image guidance, atlas construction, etc. ...
Bing Jian, Baba C. Vemuri, José L. Marroqu&...
STOC
2005
ACM
115views Algorithms» more  STOC 2005»
16 years 4 months ago
Lower-stretch spanning trees
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
Michael Elkin, Yuval Emek, Daniel A. Spielman, Sha...