412 search results - page 54 / 83 » A New Proof of the F5 Algorithm |
129
click to vote
GOSLER
1995
15 years 1 months ago
1995
The present paper deals with the learnability of indexed families of uniformly recursive languages from positive data as well as from both, positive and negative data. We consider...
COMSWARE
2007
IEEE
15 years 4 months ago
2007
IEEE
— In this paper, we focus on the construction of an efficient dominating set in ad hoc and sensor networks. A set of nodes is said to be dominating if each node is either itself...
JSC
2007
14 years 9 months ago
2007
A well-known result due to J. T. Stafford asserts that a stably free left module M over the Weyl algebras D = An(k) or Bn(k) − where k is a field of characteristic 0 − with ...
MICCAI
2005
Springer
15 years 10 months ago
2005
Springer
The spherical harmonic (SPHARM) description is a powerful surface modeling technique that can model arbitrarily shaped but simply connected 3D objects and has been used in many app...
APPROX
2004
Springer
15 years 3 months ago
2004
Springer
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...