867 search results - page 99 / 174 » On Two Forms of Structural Recursion |
135
click to vote
PAIRING
2007
Springer
16 years 8 days ago
2007
Springer
— In EUROCRYPT 2006, Cheon proposed breakthrough algorithms for pairing-related problems such as the q-weak/strong Diffie-Hellman problem. Using that the exponents of an element ...
190
click to vote
ICALT
2006
IEEE
16 years 6 days ago
2006
IEEE
Generally speaking, in the e-learning systems, a course is modeled as a graph, where each node represents a knowledge node (KU) and two nodes are connected to form a semantic netw...
130
click to vote
IROS
2006
IEEE
16 years 5 days ago
2006
IEEE
— This paper formalizes and proposes an algorithm to compute coverage diameters of polygons in 2D. Roughly speaking, the coverage diameter of a polygon is the longest possible di...
135
click to vote
TIME
2005
IEEE
15 years 11 months ago
2005
IEEE
— We provide a novel trace semantics for positive core XPath that exposes all intermediate nodes visited by the query engine. This enables a detailed analysis of all information ...
139
click to vote
ECSQARU
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In previous papers, we have presented a framework for merging structured information in XML involving uncertainty in the form of probabilities, degrees of beliefs and nec...