461 search results - page 31 / 93 » Practical polynomial factoring in polynomial time |
TSMC
2010
14 years 4 months ago
2010
In this paper, we present two near-optimal methods to determine the real-time collision-free path for a mobile vehicle moving in a dynamically changing environment. The proposed de...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
111
click to vote
AAIM
2007
Springer
15 years 3 months ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
SIGIR
2011
ACM
14 years 15 days ago
2011
ACM
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
64
Voted
ARITH
2007
IEEE
15 years 4 months ago
2007
IEEE
In the present paper, we investigate the approximation of a function by a polynomial with floating-point coefficients; we are looking for the best approximation in the L2 sense....