Sciweavers

1813 search results - page 244 / 363
» Calculi of Approximation Spaces
Sort
View
TON
2008
125views more  TON 2008»
15 years 4 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
TSP
2008
88views more  TSP 2008»
15 years 4 months ago
Statistical Performance of MUSIC-Like Algorithms in Resolving Noncircular Sources
Abstract--This paper addresses the resolution of the conventional and noncircular MUSIC algorithms for arbitrary circular and noncircular second-order distributions of two uncorrel...
Habti Abeida, Jean Pierre Delmas
JUCS
2002
131views more  JUCS 2002»
15 years 4 months ago
Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
Dana Cristofor, Dan A. Simovici
SIGIR
2002
ACM
15 years 4 months ago
PageRank, HITS and a unified framework for link analysis
Two popular webpage ranking algorithms are HITS and PageRank. HITS emphasizes mutual reinforcement between authority and hub webpages, while PageRank emphasizes hyperlink weight n...
Chris H. Q. Ding, Xiaofeng He, Parry Husbands, Hon...
NA
2007
100views more  NA 2007»
15 years 4 months ago
Periodization strategy may fail in high dimensions
Abstract. We discuss periodization of smooth functions f of d variables for approximation of multivariate integrals. The benefit of periodization is that we may use lattice rules,...
Frances Y. Kuo, Ian H. Sloan, Henryk Wozniakowski