Sciweavers

250 search results - page 45 / 50
» Fixed Argument Pairings
Sort
View
SEMWEB
2005
Springer
14 years 3 months ago
RelExt: A Tool for Relation Extraction from Text in Ontology Extension
Abstract. Domain ontologies very rarely model verbs as relations holding between concepts. However, the role of the verb as a central connecting element between concepts is undenia...
Alexander Schutz, Paul Buitelaar
PKC
1999
Springer
115views Cryptology» more  PKC 1999»
14 years 2 months ago
Decision Oracles are Equivalent to Matching Oracles
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
Helena Handschuh, Yiannis Tsiounis, Moti Yung
TIT
2010
146views Education» more  TIT 2010»
13 years 4 months ago
Cooperation with an untrusted relay: a secrecy perspective
We consider the communication scenario where a source-destination pair wishes to keep the information secret from a relay node despite wanting to enlist its help. For this scenario...
Xiang He, Aylin Yener
ICCV
2001
IEEE
14 years 11 months ago
Beyond Lambert: Reconstructing Surfaces with Arbitrary BRDFs
W e address an open and hitherto neglected problem in computer vision, how to reconstruct the geometry of objects with arbitrary and possibly anisotropic bidirectional reflectance...
Sebastian Magda, David J. Kriegman, Todd Zickler, ...
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
14 years 10 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos