536 search results - page 59 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
144
click to vote
COCO
2005
Springer
15 years 11 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
199
click to vote
COMPGEOM
2007
ACM
15 years 8 months ago
2007
ACM
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...
144
click to vote
QEST
2006
IEEE
16 years 4 days ago
2006
IEEE
We analyze the effect of a few fiber delay loops on the number of deflections in an all optical packet switch. The switch is based on the ROMEO architecture developed by Alcatel...
168
click to vote
MLDM
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we describe a new cluster model which is based on the concept of linear manifolds. The method identifies subsets of the data which are embedded in arbitrary oriented...
169
click to vote
ICIP
2001
IEEE
16 years 7 months ago
2001
IEEE
The type of representation used in describing shape can have a significant impact on the effectiveness of a recognition strategy. Shape has been represented by its bounding curve ...