3146 search results - page 185 / 630 » Efficient Consequence Finding |
163
click to vote
SIGCOMM
1996
ACM
15 years 10 months ago
1996
ACM
Wormhole routing LANs are emerging as an effective solution for high-bandwidth, low-latency interconnects in distributed computing and cluster computing applications. An important...
155
click to vote
CHES
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Recently, Lenstra and Verheul proposed an efficient cryptosystem called XTR. This system represents elements of F p6 with order dividing p2 -p+1 by their trace over Fp2 ....
223
click to vote
DASFAA
2004
IEEE
15 years 9 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
209
click to vote
ETVC
2008
15 years 7 months ago
2008
In a seminal paper, Amari (1998) proved that learning can be made more efficient when one uses the intrinsic Riemannian structure of the algorithms' spaces of parameters to po...
144
click to vote
DLT
2008
15 years 7 months ago
2008
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...