Sciweavers

2080 search results - page 181 / 416
» Measuring empirical computational complexity
Sort
View
SAC
2010
ACM
15 years 11 months ago
Feature interaction networks
A quantitative approach for measuring and describing feature interactions in object-oriented software components based on source code inspection is presented. The methodical arsen...
Stefan Sobernig
PAM
2009
Springer
15 years 11 months ago
Access Point Localization Using Local Signal Strength Gradient
Abstract. Many previous studies have examined the placement of access points (APs) to improve the community’s understanding of the deployment and behavioral characteristics of wi...
Dongsu Han, David G. Andersen, Michael Kaminsky, K...
IMSCCS
2006
IEEE
15 years 11 months ago
A New Scheduling Algorithm for Servers
Slowdown is used to measure the fairness degree of a scheduling algorithm in existing work. However, the fairness degree should be considered within a scheduling algorithm; rather...
Nianmin Yao, Wenbin Yao, Shaobin Cai, Jun Ni
ICAISC
2010
Springer
15 years 9 months ago
Quasi-parametric Recovery of Hammerstein System Nonlinearity by Smart Model Selection
In the paper we recover a Hammerstein system nonlinearity. Hammerstein systems, incorporating nonlinearity and dynamics, play an important role in various applications, and e¤ecti...
Zygmunt Hasiewicz, Grzegorz Mzyk, Przemyslaw Sliwi...
163
Voted
ICASSP
2010
IEEE
15 years 5 months ago
Texas Hold 'Em algorithms for distributed compressive sensing
This paper develops a new class of algorithms for signal recovery in the distributed compressive sensing (DCS) framework. DCS exploits both intra-signal and inter-signal correlati...
Stephen R. Schnelle, Jason N. Laska, Chinmay Hegde...