Sciweavers

422 search results - page 48 / 85
» On Non-Approximability for Quadratic Programs
Sort
View
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
14 years 2 months ago
On the semantics and evaluation of top-k queries in probabilistic databases
We formulate three intuitive semantic properties for topk queries in probabilistic databases, and propose GlobalTopk query semantics which satisfies all of them. We provide a dyn...
Xi Zhang, Jan Chomicki
GD
2007
Springer
14 years 2 months ago
Constrained Stress Majorization Using Diagonally Scaled Gradient Projection
Abstract. Constrained stress majorization is a promising new technique for integrating application specific layout constraints into forcedirected graph layout. We significantly i...
Tim Dwyer, Kim Marriott
IJCNN
2000
IEEE
14 years 14 days ago
Support Vector Machine for Regression and Applications to Financial Forecasting
The main purpose of this paper is to compare the support vector machine (SVM) developed by Vapnik with other techniques such as Backpropagation and Radial Basis Function (RBF) Net...
Theodore B. Trafalis, Huseyin Ince
EURODAC
1995
IEEE
112views VHDL» more  EURODAC 1995»
13 years 11 months ago
Post routing performance optimization via tapered link insertion and wiresizing
Most existing performance-driven and clock routing algorithms can not guarantee performance after all nets are routed. This paper proposes a new post routing approach which can re...
Tianxiong Xue, Ernest S. Kuh
ESANN
2008
13 years 9 months ago
On related violating pairs for working set selection in SMO algorithms
Sequential Minimal Optimization (SMO) is currently the most popular algorithm to solve large quadratic programs for Support Vector Machine (SVM) training. For many variants of this...
Tobias Glasmachers