2853 search results - page 289 / 571 » On Coherence in Computer Algebra |
137
Voted
NIPS
2007
15 years 6 months ago
2007
Statistical models on full and partial rankings of n items are often of limited practical use for large n due to computational consideration. We explore the use of non-parametric ...
132
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...
121
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We give a survey of algorithms for computing topological invariants of semi-algebraic sets with special emphasis on the more recent developments in designing algorithms f...
114
click to vote
JC
2006
15 years 4 months ago
2006
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
132
click to vote
TJS
2008
15 years 4 months ago
2008
Abstract Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between ...