Sciweavers

1236 search results - page 98 / 248
» Prefix-Like Complexities and Computability in the Limit
Sort
View
IPPS
2007
IEEE
15 years 4 months ago
Speculative Flow Control for High-Radix Datacenter Interconnect Routers
High-radix switches are desirable building blocks for large computer interconnection networks, because they are more suitable to convert chip I/O bandwidth into low latency and lo...
Cyriel Minkenberg, Mitchell Gusat
PG
2007
IEEE
15 years 4 months ago
Wrestle Alone : Creating Tangled Motions of Multiple Avatars from Individually Captured Motions
Animations of two avatars tangled with each other often appear in battle or fighting scenes in movies or games. However, creating such scenes is difficult due to the limitations...
Edmond S. L. Ho, Taku Komura
ICDM
2005
IEEE
142views Data Mining» more  ICDM 2005»
15 years 3 months ago
Shortest-Path Kernels on Graphs
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
Karsten M. Borgwardt, Hans-Peter Kriegel
ICPPW
2005
IEEE
15 years 3 months ago
Factoring Solution Sets of Polynomial Systems in Parallel
We report on a £rst parallel implementation of a recent algorithm to factor positive dimensional solution sets of polynomial systems. As the algorithm uses homotopy continuation,...
Anton Leykin, Jan Verschelde
EUROPKI
2004
Springer
15 years 3 months ago
On the Use of Weber Polynomials in Elliptic Curve Cryptography
Abstract. In many cryptographic applications it is necessary to generate elliptic curves (ECs) with certain security properties. These curves are commonly constructed using the Com...
Elisavet Konstantinou, Yannis C. Stamatiou, Christ...