Sciweavers

6740 search results - page 465 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
COMPGEOM
2004
ACM
16 years 8 days ago
Separating point sets in polygonal environments
We consider the separability of two point sets inside a polygon by means of chords or geodesic lines. Specifically, given a set of red points and a set of blue points in the inte...
Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Jo...
ITC
2003
IEEE
136views Hardware» more  ITC 2003»
16 years 3 days ago
A BIST Solution for The Test of I/O Speed
A delay-locked loop (DLL) based built-in self test (BIST) circuit has been designed with a 0.18 µ m TSMC process (CM018) to test chip I/O speeds, specifically, the setup and hold...
Cheng Jia, Linda S. Milor
COMPGEOM
2000
ACM
15 years 11 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
ACCV
1998
Springer
15 years 11 months ago
VR Models from Epipolar Images: An Approach to Minimize Errors in Synthesized Images
A new paradigm, the minimization of errors in synthesized images, is introduced to organically combine Computer Vision and Computer Graphics for Virtual Reality applications. Based...
Mikio Shinya, Takafumi Saito, Takeaki Mori, Noriyo...
ANNPR
2006
Springer
15 years 10 months ago
Support Vector Regression Using Mahalanobis Kernels
Abstract. In our previous work we have shown that Mahalanobis kernels are useful for support vector classifiers both from generalization ability and model selection speed. In this ...
Yuya Kamada, Shigeo Abe