Sciweavers

2259 search results - page 100 / 452
» Addressing Mode Selection
Sort
View
RTAS
2010
IEEE
15 years 25 days ago
Selecting Server Parameters for Predictable Runtime Monitoring
—Application of runtime monitoring to maintain the health of an embedded real-time software system requires that anomalous behavior be detected within a bounded time while preser...
Haitao Zhu, Steve Goddard, Matthew B. Dwyer
116
Voted
WIOPT
2010
IEEE
15 years 23 days ago
Low complexity algorithms for relay selection and power control in interference-limited environments
Abstract—We consider an interference-limited wireless network, where multiple source-destination pairs compete for the same pool of relay nodes. In an attempt to maximize the sum...
Lazaros Gkatzikis, Iordanis Koutsopoulos
ICPR
2002
IEEE
16 years 3 months ago
Prototype Selection for Finding Efficient Representations of Dissimilarity Data
The nearest neighbor (NN) rule is a simple and intuitive method for solving classification problems. Originally, it uses distances to the complete training set. It performs well, ...
Elzbieta Pekalska, Robert P. W. Duin
ICML
2006
IEEE
16 years 3 months ago
A DC-programming algorithm for kernel selection
We address the problem of learning a kernel for a given supervised learning task. Our approach consists in searching within the convex hull of a prescribed set of basic kernels fo...
Andreas Argyriou, Raphael Hauser, Charles A. Micch...
195
Voted
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 2 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang