Sciweavers

893 search results - page 115 / 179
» P3C: A New Algorithm for the Simple Temporal Problem
Sort
View
ICDCSW
2006
IEEE
14 years 3 months ago
Multi-radio channel allocation in competitive wireless networks
Channel allocation has been extensively studied in the framework of cellular networks, but the emergence of new system concepts, such as cognitive radio systems, bring this topic ...
Márk Félegyházi, Mario Cagalj...
NIPS
1993
13 years 10 months ago
Fast Pruning Using Principal Components
We present a new algorithm for eliminating excess parameters and improving network generalization after supervised training. The method, \Principal Components Pruning (PCP)",...
Asriel U. Levin, Todd K. Leen, John E. Moody
DCG
1998
53views more  DCG 1998»
13 years 8 months ago
Motion Planning in Environments with Low Obstacle Density
We present a simple and e cient paradigm for computing the exact solution of the motionplanning problem in environments with a low obstacle density. Such environments frequently o...
A. Frank van der Stappen, Mark H. Overmars, Mark d...
IVS
2002
106views more  IVS 2002»
13 years 8 months ago
Pixel bar charts: a visualization technique for very large multi-attribute data sets?
Simple presentation graphics are intuitive and easy-to-use, but show only highly aggregated data presenting only a very small number of data values (as in the case of bar charts) ...
Daniel A. Keim, Ming C. Hao, Umeshwar Dayal, Meich...
ICASSP
2011
IEEE
13 years 20 days ago
Low-rank matrix completion with geometric performance guarantees
—The low-rank matrix completion problem can be stated as follows: given a subset of the entries of a matrix, find a low-rank matrix consistent with the observations. There exist...
Wei Dai, Ely Kerman, Olgica Milenkovic