2063 search results - page 90 / 413 » connection 2007 |
JC
2007
14 years 11 months ago
2007
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
69
Voted
ACL
2007
15 years 15 days ago
2007
Live closed-captions for deaf and hard of hearing audiences are currently produced by stenographers, or by voice writers using speech recognition. Both techniques can produce capt...
101
click to vote
COMPGEOM
2007
ACM
15 years 3 months ago
2007
ACM
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
IPCV
2007
15 years 14 days ago
2007
Abstract In the analysis of any unconstrained document image it is necessary to first decide what the main area of interest is. Previous work has been done on simply removing the ...
IJCNN
2007
IEEE
15 years 5 months ago
2007
IEEE
— A spiking neural network model is used to identify characters in a character set. The network is a two layered structure consisting of integrate-and-fire and active dendrite n...