Sciweavers

4913 search results - page 26 / 983
» Results and Perspectives of the G
Sort
View
ICCV
1999
IEEE
14 years 1 months ago
What Can Be Determined from a Full and a Weak Perspective Image?
This paper presents a first investigation on the structure from motion problem from the combination of full and weak perspective images. This problem arises in multiresolution obj...
Zhengyou Zhang, P. Anandan, Heung-Yeung Shum
EUROCRYPT
2004
Springer
14 years 2 months ago
Projective Coordinates Leak
Denoting by P = [k]G the elliptic-curve double-and-add multiplication of a public base point G by a secret k, we show that allowing an adversary access to the projective representa...
David Naccache, Nigel P. Smart, Jacques Stern
APN
2009
Springer
14 years 3 months ago
Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
In previous works we defined ν-APNs, an extension of P/T nets with the capability of creating and managing pure names. We proved that, though reachability is undecidable, coverab...
Fernando Rosa Velardo, David de Frutos-Escrig
SEMWEB
2007
Springer
14 years 3 months ago
SEMA: Results for the Ontology Alignment Contest OAEI 2007
In this paper we present SEMA tool for the automatic mapping of ontologies. The main purpose of SEMA is to locate one to one equivalence correspondences (mappings) between elements...
Vassilis Spiliopoulos, Alexandros G. Valarakos, Ge...
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
14 years 2 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud