Sciweavers

2432 search results - page 238 / 487
» Degrees and choice numbers
Sort
View
MOC
1998
93views more  MOC 1998»
15 years 6 months ago
Computing ray class groups, conductors and discriminants
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (ZK /m)∗ for an ideal m of a number field K, as well as ray class gr...
Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
CANDC
2009
ACM
16 years 1 months ago
Subliminal wiretapping
Subliminal Wiretapping is a subtly interactive artwork that utilizes random number generation modified through mindmatter effects to supply a continuous stream of words. Frequent,...
Shawn Lawson
COCOA
2007
Springer
16 years 23 days ago
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...
ICCAD
2006
IEEE
101views Hardware» more  ICCAD 2006»
16 years 19 days ago
Thermal-induced leakage power optimization by redundant resource allocation
Traditionally, at early design stages, leakage power is associated with the number of transistors in a design. Hence, intuitively an implementation with minimum resource usage wou...
Min Ni, Seda Ogrenci Memik
SIAMCOMP
2010
100views more  SIAMCOMP 2010»
15 years 5 months ago
Algorithmic Enumeration of Ideal Classes for Quaternion Orders
We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the ...
Markus Kirschmer, John Voight