Sciweavers

2478 search results - page 406 / 496
» Universality in two dimensions
Sort
View
CN
1998
64views more  CN 1998»
15 years 10 days ago
Decentralized Network Connection Preemption Algorithms
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
Mohammad Peyravian, Ajay D. Kshemkalyani
GIS
1998
ACM
15 years 9 days ago
Mean-Variance Analysis of the Performance of Spatial Ordering Methods
Geographical Information Systems (GIS) involve the manipulation of large spatial data sets, and the performance of these systems is often determined by how these data sets are orga...
Akhil Kumar, Waleed A. Muhanna, Raymond A. Patters...
100
Voted
INFORMS
1998
100views more  INFORMS 1998»
15 years 9 days ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
167
Voted
CORR
1999
Springer
222views Education» more  CORR 1999»
15 years 9 days ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
99
Voted
TON
2002
93views more  TON 2002»
15 years 8 days ago
Static and dynamic approaches to modeling end-to-end routing in circuit-switched networks
We present two routing strategies, identified herein as static least loaded routing (SLLR) and dynamic least loaded routing (DLLR). Dynamic routing in circuit-switched networks has...
Young Lee, James M. Tien