Sciweavers

2168 search results - page 363 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
AUSDM
2008
Springer
237views Data Mining» more  AUSDM 2008»
15 years 5 months ago
On Inconsistencies in Quantifying Strength of Community Structures
Complex network analysis involves the study of the properties of various real world networks. In this broad field, research on community structures forms an important sub area. Th...
Wen Haw Chong
IDA
2010
Springer
15 years 4 months ago
A Framework for Path-Oriented Network Simplification
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
Hannu Toivonen, Sébastien Mahler, Fang Zhou
DAGM
2008
Springer
15 years 4 months ago
Resolution Enhancement of PMD Range Maps
Photonic mixer device (PMD) range cameras are becoming popular as an alternative to algorithmic 3D reconstruction but their main drawbacks are low-resolution (LR) and noise. Recent...
A. N. Rajagopalan, Arnav V. Bhavsar, Frank Wallhof...
BIOCOMP
2007
15 years 4 months ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ï...
Xuehui Li, Tamer Kahveci
ICMLA
2007
15 years 4 months ago
Scalable optimal linear representation for face and object recognition
Optimal Component Analysis (OCA) is a linear method for feature extraction and dimension reduction. It has been widely used in many applications such as face and object recognitio...
Yiming Wu, Xiuwen Liu, Washington Mio