Sciweavers

9359 search results - page 240 / 1872
» Generalization Algorithms for Second-Order Terms
Sort
View
117
Voted
MOBIHOC
2003
ACM
16 years 4 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
IMA
2009
Springer
111views Cryptology» more  IMA 2009»
15 years 11 months ago
Geometric Ideas for Cryptographic Equation Solving in Even Characteristic
Abstract. The GeometricXL algorithm is a geometrically invariant version of the XL algorithm that uses polynomials of a much smaller degree than either a standard Groebner basis al...
Sean Murphy, Maura B. Paterson
156
Voted
COMPGEOM
2003
ACM
15 years 10 months ago
Updating and constructing constrained delaunay and constrained regular triangulations by flips
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
Jonathan Richard Shewchuk
166
Voted
ISLPED
2003
ACM
95views Hardware» more  ISLPED 2003»
15 years 10 months ago
Power-aware scheduling of conditional task graphs in real-time multiprocessor systems
We propose a novel power-aware task scheduling algorithm for DVS-enabled real-time multiprocessor systems. Unlike the existing algorithms, the proposed DVS algorithm can handle co...
Dongkun Shin, Jihong Kim
121
Voted
TIT
1998
90views more  TIT 1998»
15 years 4 months ago
On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain of L, and are obtained ba...
Amir H. Banihashemi, Amir K. Khandani