Sciweavers

4298 search results - page 344 / 860
» Measurable chromatic numbers
Sort
View
SEBD
2008
169views Database» more  SEBD 2008»
15 years 8 months ago
Clustering the Feature Space
Abstract Dino Ienco and Rosa Meo Dipartimento di Informatica, Universit`a di Torino, Italy In this paper we propose and test the use of hierarchical clustering for feature selectio...
Dino Ienco, Rosa Meo
MOBIMEDIA
2007
15 years 8 months ago
Experimental evaluation of community-based WLAN voice and data services
The purpose of this work is to experimentally evaluate the quality of voice and data services over community-based WLAN access networks. We use P2PWNC, the Wireless LAN roaming ar...
Pantelis A. Frangoudis, Vasileios P. Kemerlis, Dim...
160
Voted
WSC
1998
15 years 8 months ago
Comparison of Bayesian and Frequentist Assessments of Uncertainty for Selecting the Best System
An important problem in discrete-event stochastic simulation is the selection of the best system from a finite set of alternatives. There are many techniques for ranking and selec...
Koichiro Inoue, Stephen E. Chick
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
15 years 8 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson
AAAI
1990
15 years 8 months ago
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Ramin Zabih