Sciweavers

1871 search results - page 8 / 375
» The Ephemeral Pairing Problem
Sort
View
PR
2000
82views more  PR 2000»
13 years 7 months ago
Holistic recognition of handwritten character pairs
Researchers have thus far focused on the recognition of alpha and numeric characters in isolation as well as in context. In this paper we introduce a new genre of problems where t...
Xian Wang, Venu Govindaraju, Sargur N. Srihari
ESEM
2008
ACM
13 years 9 months ago
Pair programming: what's in it for me?
Pair programming is a practice in which two programmers work collaboratively at one computer on the same design, algorithm, or code. Prior research on pair programming has primari...
Andrew Begel, Nachiappan Nagappan
ICISC
2007
100views Cryptology» more  ICISC 2007»
13 years 8 months ago
Pairing-Friendly Elliptic Curves with Small Security Loss by Cheon's Algorithm
Pairing based cryptography is a new public key cryptographic scheme. An elliptic curve suitable for pairing based cryptography is called a “pairing-friendly” elliptic curve. Af...
Aya Comuta, Mitsuru Kawazoe, Tetsuya Takahashi
AAIM
2007
Springer
145views Algorithms» more  AAIM 2007»
14 years 1 months ago
Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
We study three closely related problems motivated by the prediction of RNA secondary structures with arbitrary pseudoknots: the MAXIMUM BASE PAIR STACKINGS problem proposed by Ieon...
Minghui Jiang
ENGL
2007
94views more  ENGL 2007»
13 years 7 months ago
Common subproofs in proof pairs
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
Guillermo Morales-Luna