Sciweavers

13987 search results - page 763 / 2798
» The Two Guards Problem
Sort
View
FOCS
2002
IEEE
16 years 18 days ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich
HICSS
2002
IEEE
93views Biometrics» more  HICSS 2002»
16 years 18 days ago
A Combination Measurement for Studying Disorientation
The disorientation problem has been known to exist on hypertext and hypermedia systems. Various approaches have also been recommended and implemented in order to eliminate or redu...
Noor F. M. Yatim
ICDM
2002
IEEE
156views Data Mining» more  ICDM 2002»
16 years 18 days ago
Predicting Rare Events In Temporal Domains
Temporal data mining aims at finding patterns in historical data. Our work proposes an approach to extract temporal patterns from data to predict the occurrence of target events,...
Ricardo Vilalta, Sheng Ma
ICPPW
2002
IEEE
16 years 18 days ago
Finding Multiple Routing Paths in Wide-Area WDM Networks
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
Weifa Liang, Xiaojun Shen
INFOCOM
2002
IEEE
16 years 17 days ago
Exploiting OTDM technology in WDM networks
— Wavelength routed optical networks allow to design a logical topology, comprising lightpaths and routers, which is overlayed on the physical topology, comprising optical fiber...
Marco Mellia, Emilio Leonardi, Marco Feletig, Robe...