363 search results - page 24 / 73 » Finding Small Solutions to Small Degree Polynomials |
KDD
1995
ACM
13 years 11 months ago
1995
ACM
We report a novel possibility for extracting a small subset of a data base which contains all the information necessary to solve a given classification task: using the Support Vec...
IM
2008
13 years 7 months ago
2008
We analyze the structure of random graphs generated by the geographical threshold model. The model is a generalization of random geometric graphs. Nodes are distributed in space, a...
GROUP
2007
ACM
13 years 11 months ago
2007
ACM
Employees depend on other people in the enterprise for rapid access to important information. But current systems for finding experts do not adequately address the social implicat...
JSC
2010
13 years 2 months ago
2010
A Chebyshev knot C(a, b, c, ) is a knot which has a parametrization of the form x(t) = Ta(t); y(t) = Tb(t); z(t) = Tc(t + ), where a, b, c are integers, Tn(t) is the Chebyshev pol...
MST
1998
13 years 7 months ago
1998
We consider the problem of merging two sorted sequences on constant degree networks using comparators only. The classical solution to the problem are the networks based on Batcherâ...