Sciweavers

2432 search results - page 96 / 487
» Degrees and choice numbers
Sort
View
ANTS
2008
Springer
115views Algorithms» more  ANTS 2008»
15 years 8 months ago
Computing Hilbert Modular Forms over Fields with Nontrivial Class Group
In previous work, the first author developed an algorithm for the computation of Hilbert modular forms. In this paper, we extend this to all totally real number fields of even degr...
Lassina Dembélé, Steve Donnelly
PDPTA
1996
15 years 7 months ago
Evaluation of Dynamic Data Distributions on NUMA Shared Memory Multiprocessors
Dynamic data distributions offer a number of performance benefits, but require more sophisticated compiler support and incur run-time overhead. We investigate attainable benefits ...
Tarek S. Abdelrahman, Kenneth L. Ma
DAM
2006
47views more  DAM 2006»
15 years 6 months ago
Trees of extremal connectivity index
The connectivity index w(G) of a graph G is the sum of the weights (d(u)d(v)) of all edges uv of G, where is a real number ( = 0), and d(u) denotes the degree of the vertex u. Le...
Huiqing Liu, Mei Lu, Feng Tian
TC
2008
15 years 6 months ago
Localized Broadcasting with Guaranteed Delivery and Bounded Transmission Redundancy
The common belief is that localized broadcast algorithms are not able to guarantee both full delivery and a good bound on the number of transmissions. In this paper, we propose the...
Majid Khabbazian, Vijay K. Bhargava
IJCGA
2002
69views more  IJCGA 2002»
15 years 6 months ago
On Deletion in Delaunay Triangulations
This paper presents how the space of spheres and shelling may be used to delete a point from a d-dimensional triangulation efficiently. In dimension two, if k is the degree of the...
Olivier Devillers