Sciweavers

2173 search results - page 348 / 435
» On the Values of Reducibility Candidates
Sort
View
NETWORKING
2004
15 years 7 months ago
Hierarchical Routing with QoS Constraints in Optical Transport Networks
Abstract. Optical Transport Networks (OTN) with automatical switching capabilities are named ASON. Hierarchical routing is required in the ASON recommendations to achieve scalabili...
Xavier Masip-Bruin, Sergio Sánchez-Ló...
NIPS
2001
15 years 7 months ago
Estimating Car Insurance Premia: a Case Study in High-Dimensional Data Inference
Estimating insurance premia from data is a difficult regression problem for several reasons: the large number of variables, many of which are discrete, and the very peculiar shape...
Nicolas Chapados, Yoshua Bengio, Pascal Vincent, J...
IC
2003
15 years 7 months ago
Sampling Internet Topologies: How Small Can We Go?
Abstract— In this paper, we develop methods to “sample” a large real network into a small realistic graph. Although topology modeling has received a lot attention lately, it ...
Vaishnavi Krishnamurthy, Junhong Sun, Michalis Fal...
DMDW
2000
151views Management» more  DMDW 2000»
15 years 7 months ago
Automated dimensionality reduction of data warehouses
A data warehouse is designed to consolidate and maintain all attributes that are relevant for the analysis processes. Due to the rapid increase in the size of the modern operation...
Mark Last, Oded Maimon
WOB
2003
140views Bioinformatics» more  WOB 2003»
15 years 7 months ago
Computing Maximum Subsequence in Parallel
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
Carlos E. R. Alves, Edson Cáceres, Siang W....