Sciweavers

537 search results - page 28 / 108
» A new upper bound for 3-SAT
Sort
View
COMPGEOM
2005
ACM
13 years 10 months ago
Abstract order type extension and new results on the rectilinear crossing number
Order Type Extension and New Results ectilinear Crossing Number - Extended Abstract Oswin Aichholzer∗ Hannes Krasser† We provide a complete data base of all realizable order t...
Oswin Aichholzer, Hannes Krasser
WSC
2001
13 years 9 months ago
A new approach to pricing American-style derivatives
This paper presents a new approach to pricing Americanstyle derivatives. By approximating the value function with a piecewise linear interpolation function, the option holder'...
Scott B. Laprise, Michael C. Fu, Steven I. Marcus,...
KI
2006
Springer
13 years 8 months ago
A Framework for Quasi-exact Optimization Using Relaxed Best-First Search
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
Rüdiger Ebendt, Rolf Drechsler
CORR
2008
Springer
73views Education» more  CORR 2008»
13 years 8 months ago
Sum Capacity of the Gaussian Interference Channel in the Low Interference Regime
New upper bounds on the sum capacity of the two-user Gaussian interference channel are derived. Using these bounds, it is shown that treating interference as noise achieves the sum...
V. Sreekanth Annapureddy, Venugopal V. Veeravalli
ENDM
2008
93views more  ENDM 2008»
13 years 8 months ago
On Universal Graphs of Minor Closed Families
For a family F of graphs, a graph U is said to be F-universal if every graph of F is a subgraph of U. Similarly, a graph is said to be F-induced-universal if every graph of F is a...
Arnaud Labourel