Sciweavers

490 search results - page 38 / 98
» Practical Extensions to the IFDS Algorithm
Sort
View
P2P
2008
IEEE
14 years 3 months ago
Flexible Routing in Grouped DHTs
In most DHTs proposed so far, all nodes are assumed to be homogeneous, and all messages are routed using a common algorithm. In practice, however, nodes in large-scale systems mig...
Yiming Zhang, Dongsheng Li, Lei Chen 0002, Xicheng...
ISSAC
2005
Springer
125views Mathematics» more  ISSAC 2005»
14 years 2 months ago
Generalized normal forms and polynomial system solving
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
Bernard Mourrain
ICCS
2004
Springer
14 years 2 months ago
Routing and Wavelength Assignments in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
Hyunseung Choo, Vladimir V. Shakhov
KDD
1998
ACM
146views Data Mining» more  KDD 1998»
14 years 1 months ago
Mining Association Rules in Hypertext Databases
In this workweproposea generalisation of the notion of associationrule in the contextof flat transactions to that of a compositeassociation rule in the context of a structured dir...
José Borges, Mark Levene
ASPDAC
2006
ACM
108views Hardware» more  ASPDAC 2006»
14 years 20 days ago
Spec-based flip-flop and latch repeater planning
Abstract-- Shrinking process geometries and frequency scaling give rise to an increasing number of interconnects that require multiple clock cycles. This paper explores efficient t...
Man Chung Hon