19320 search results - page 245 / 3864 » On the complexity of computing determinants |
155
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
174
click to vote
ICEBE
2007
IEEE
16 years 28 days ago
2007
IEEE
In both E-Commerce (EC) and Service-Oriented Computing (SOC) environments, sellers or service providers interact with customers or service clients for services or transactions. Fr...
167
click to vote
ECML
2007
Springer
16 years 24 days ago
2007
Springer
Action-based dependency parsing, also known as deterministic dependency parsing, has often been regarded as a time efficient parsing algorithm while its parsing accuracy is a littl...
161
click to vote
COCO
2005
Springer
16 years 4 days 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...
201
click to vote
SAC
2004
ACM
16 years 1 days ago
2004
ACM
Techniques that support effective communication during teamwork processes are of particular importance. Psychological study shows that an effective team often can anticipate infor...