Sciweavers

2229 search results - page 117 / 446
» Comparative analysis of biclustering algorithms
Sort
View
VTC
2010
IEEE
140views Communications» more  VTC 2010»
15 years 3 months ago
Analysis of Local Quasi-Stationarity Regions in an Urban Macrocell Scenario
—A common simplification in the treatment of random linear channels is the wide-sense stationary and uncorrelated scattering (WSSUS) assumption. For wireless channels, this assu...
Adrian Ispas, Gerd Ascheid, Christian Schneider, R...
INFORMATICALT
2000
126views more  INFORMATICALT 2000»
15 years 4 months ago
Adaptive Integration of Stiff ODE
The accuracy of adaptive integration algorithms for solving stiff ODE is investigated. The analysis is done by comparing the discrete and exact amplification factors of the equatio...
Raimondas Ciegis, Olga Suboc, Remigijus Ciegis
ICPR
2006
IEEE
16 years 6 months ago
Fast Linear Feature Detection Using Multiple Directional Non-Maximum Suppression
Linear feature detection is a very important issue in the areas of image analysis, computer vision, and pattern recognition. It has found applications in many diverse areas such a...
Changming Sun, Pascal Vallotton
SAC
2008
ACM
15 years 4 months ago
Flexible pointer analysis using assign-fetch graphs
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
Marcio Buss, Daniel Brand, Vugranam C. Sreedhar, S...
ASPDAC
2009
ACM
115views Hardware» more  ASPDAC 2009»
15 years 11 months ago
Incremental and on-demand random walk for iterative power distribution network analysis
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
Yiyu Shi, Wei Yao, Jinjun Xiong, Lei He