Sciweavers

2255 search results - page 127 / 451
» Computing a Center-Transversal Line
Sort
View
ICANN
2005
Springer
15 years 4 months ago
Training of Support Vector Machines with Mahalanobis Kernels
Abstract. Radial basis function (RBF) kernels are widely used for support vector machines. But for model selection, we need to optimize the kernel parameter and the margin paramete...
Shigeo Abe
JCDCG
2004
Springer
15 years 4 months ago
Farthest-Point Queries with Geometric and Combinatorial Constraints
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexande...
IOLTS
2003
IEEE
95views Hardware» more  IOLTS 2003»
15 years 4 months ago
Crosstalk Effect Minimization for Encoded Busses
In this paper we present a technique which allows to reduce the crosstalk-induced delay within busses implementing an error detecting/correcting code. This technique is based on t...
L. Di Silvio, Daniele Rossi, Cecilia Metra
75
Voted
TIME
2003
IEEE
15 years 4 months ago
A Novel Approach to Model NOW in Temporal Databases
In bitemporal databases, current facts and transaction states are modelled using a special value to represent the current time (such as a minimum or maximum timestamp or NULL). Pr...
Bela Stantic, John Thornton, Abdul Sattar
COMPGEOM
2000
ACM
15 years 3 months ago
When crossings count - approximating the minimum spanning tree
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
Sariel Har-Peled, Piotr Indyk