15073 search results - page 303 / 3015 » Probabilistic algorithms for computing resultants |
117
click to vote
ICCS
2003
Springer
15 years 10 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
135
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
Routing in computer networks is a nonlinear combinatorial optimization problem with numerous constraints and is classified as an NP-complete problem. There are certain important Qo...
143
click to vote
DEBU
2008
15 years 4 months ago
2008
The open nature of collaborative recommender systems allows attackers who inject biased profile data to have a significant impact on the recommendations produced. Standard memory-...
149
click to vote
UAI
2003
15 years 6 months ago
2003
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
149
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...