Sciweavers

1672 search results - page 55 / 335
» Tightness problems in the plane
Sort
View
MOC
2000
91views more  MOC 2000»
13 years 8 months ago
A parallel method for time-discretization of parabolic problems based on contour integral representation and quadrature
We treat the time discretization of an initial-value problem for a ous abstract parabolic equation by first using a representation of the solution as an integral along the boundary...
Dongwoo Sheen, Ian H. Sloan, Vidar Thomée
COMPGEOM
1991
ACM
14 years 10 days ago
The Two Guards Problem
Given a simple polygon in the plane with two distinguished vertices, s and g, is it possible for two guards to simultaneously walk along the two boundary chains from s to g in suc...
Christian Icking, Rolf Klein
ICML
1998
IEEE
14 years 9 months ago
Feature Selection via Concave Minimization and Support Vector Machines
Computational comparison is made between two feature selection approaches for nding a separating plane that discriminates between two point sets in an n-dimensional feature space ...
Paul S. Bradley, Olvi L. Mangasarian
AISC
2000
Springer
14 years 1 months ago
Reasoning about the Elementary Functions of Complex Analysis
There are many problems with the simplification of elementary functions, particularly over the complex plane. Systems tend to make “howlers” or not to simplify enough. In thi...
Robert M. Corless, James H. Davenport, David J. Je...
CVPR
2004
IEEE
14 years 10 months ago
Segment-Based Stereo Matching Using Graph Cuts
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
Li Hong, George Chen