Sciweavers

12459 search results - page 30 / 2492
» cans 2006
Sort
View
JOLLI
1998
78views more  JOLLI 1998»
13 years 7 months ago
Proof Nets and the Complexity of Processing Center Embedded Constructions
This paper shows how proof nets can be used to formalize the notion of “incomplete dependency” used in psycholinguistic theories of the unacceptability of center-embedded const...
Mark Johnson
JUCS
2010
124views more  JUCS 2010»
13 years 6 months ago
Finding a Consistent Scenario to an Interval Algebra Network Containing Possibly Infinite Intervals
: Interval algebra networks are traditionally defined over finite intervals. In this paper, we relax this restriction by allowing one or more of the intervals involved to be infini...
André Trudel
IJMSO
2006
77views more  IJMSO 2006»
13 years 7 months ago
Ontology based document annotation: trends and open research problems
: Metadata is used to describe documents and applications, improving information seeking and retrieval and its understanding and use. Metadata can be expressed in a wide variety of...
Óscar Corcho
IJNSEC
2006
85views more  IJNSEC 2006»
13 years 7 months ago
Security Analysis of Some Batch Verifying Signatures from Pairings
Batch verification can provide large computational savings when multiple signatures are verified together. Recently, some batch verifying signature schemes have been proposed from...
Tianjie Cao, Dongdai Lin, Rui Xue
RC
2007
113views more  RC 2007»
13 years 7 months ago
A Search Algorithm for Calculating Validated Reliability Bounds
The search algorithm presented allows the CDF of a dependent variable to be bounded with 100%confidence,andallowsforaguaranteedevaluationof theerror involved.Thesereliabilitybound...
Fulvio Tonon