Sciweavers

2131 search results - page 139 / 427
» Immunity for Closed Sets
Sort
View
JISE
2008
108views more  JISE 2008»
15 years 6 months ago
Efficient Discovery of Frequent Continuities by Projected Window List Technology
Mining frequent patterns in databases is a fundamental and essential problem in data mining research. A continuity is a kind of causal relationship which describes a definite temp...
Kuo-Yu Huang, Chia-Hui Chang, Kuo-Zui Lin
TON
2008
160views more  TON 2008»
15 years 6 months ago
Label space reduction in MPLS networks: how much can a single stacked label do?
Most network operators have considered reducing LSR label spaces (number of labels used) as a way of simplifying management of underlaying Virtual Private Networks (VPNs) and there...
Fernando Solano, Thomas Stidsen, Ramón Fabr...
JCO
1998
102views more  JCO 1998»
15 years 6 months ago
Facility Location with Dynamic Distance Functions
Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlyingnetwork could be ...
Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram...
TPDS
1998
124views more  TPDS 1998»
15 years 6 months ago
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
Lars Lundberg, Håkan Lennerstad
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 5 months ago
Locally identifying coloring of graphs
Let G = (V, E) be a graph. Let c : V → N be a vertex-coloring of the vertices of G. For any vertex u, we denote by N[u] its closed neighborhood (u and its adjacent vertices), an...
Louis Esperet, Sylvain Gravier, Mickaël Monta...