Sciweavers

19320 search results - page 171 / 3864
» On the complexity of computing determinants
Sort
View
JSC
2008
126views more  JSC 2008»
15 years 5 months ago
Computing singular points of plane rational curves
We compute the singular points of a plane rational curve, parametrically given, using the implicitization matrix derived from the -basis of the curve. It is shown that singularity...
Falai Chen, Wenping Wang, Yang Liu
DEXAW
2004
IEEE
97views Database» more  DEXAW 2004»
15 years 10 months ago
A Conceptual Model Based Distance Learning System for Computer Literacy
In distance learning for computer literacy, a student's skill is dependent on personal experience. In such cases, it is important to determine the student's understandin...
Yoshiki Murotani, Minoru Uehara, Hideki Mori
IJBC
2008
88views more  IJBC 2008»
15 years 6 months ago
Characterizing the Structural Quality of General Complex Software Networks
nodes and their interactions are abstract edges. This paper attempts to characterize the structural quality of complex software networks. We propose to use a novel statistical meas...
Jing Liu, Jinhu Lu, Keqing He, Bing Li, Chi Kong T...
STOC
1991
ACM
93views Algorithms» more  STOC 1991»
15 years 10 months ago
Rounds in Communication Complexity Revisited
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
Noam Nisan, Avi Wigderson