Sciweavers

4761 search results - page 327 / 953
» Generalizing Boundary Points
Sort
View
DAGM
2004
Springer
16 years 4 days ago
Learning from Labeled and Unlabeled Data Using Random Walks
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
Dengyong Zhou, Bernhard Schölkopf
189
Voted
PKC
2004
Springer
151views Cryptology» more  PKC 2004»
16 years 3 days ago
On the Optimal Parameter Choice for Elliptic Curve Cryptosystems Using Isogeny
The isogeny for elliptic curve cryptosystems was initially used for the efficient improvement of order counting methods. Recently, Smart proposed the countermeasure using isogeny f...
Toru Akishita, Tsuyoshi Takagi
COMPGEOM
2003
ACM
16 years 14 hour ago
Planar minimally rigid graphs and pseudo-triangulations
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
Ruth Haas, David Orden, Günter Rote, Francisc...
ISLPED
2003
ACM
71views Hardware» more  ISLPED 2003»
16 years 13 hour ago
Strained-si devices and circuits for low-power applications
Static and dynamic power for strained-Si device is analyzed and compared with conventional bulk-Si technology. Optimum device design points are suggested with controlling physical...
Keunwoo Kim, Rajiv V. Joshi, Ching-Te Chuang
181
Voted
ESA
2003
Springer
141views Algorithms» more  ESA 2003»
15 years 12 months ago
Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves
We present an approach that extends the BentleyOttmann sweep-line algorithm [3] to the exact computation of the topology of arrangements induced by non-singular algebraic curves o...
Nicola Wolpert