Sciweavers

13214 search results - page 2351 / 2643
» Pseudorandomness for network algorithms
Sort
View
CSB
2003
IEEE
130views Bioinformatics» more  CSB 2003»
16 years 1 days ago
Latent Structure Models for the Analysis of Gene Expression Data
Cluster methods have been successfully applied in gene expression data analysis to address tumor classification. By grouping tissue samples into homogeneous subsets, more systema...
Dong Hua, Dechang Chen, Xiuzhen Cheng, Abdou Youss...
PVG
2003
IEEE
138views Visualization» more  PVG 2003»
16 years 20 hour ago
Sort-First, Distributed Memory Parallel Visualization and Rendering
While commodity computing and graphics hardware has increased in capacity and dropped in cost, it is still quite difficult to make effective use of such systems for general-purpos...
E. Wes Bethel, Greg Humphreys, Brian E. Paul, J. D...
CP
2003
Springer
15 years 12 months ago
Open Constraint Optimization
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
Boi Faltings, Santiago Macho-Gonzalez
AINA
2010
IEEE
15 years 12 months ago
Consensus in Anonymous Distributed Systems: Is There a Weakest Failure Detector?
: This paper is on failure detectors to solve the consensus problem in asynchronous systems made up of anonymous processes prone to crash and connected by asynchronous reliable cha...
François Bonnet, Michel Raynal
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 11 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
« Prev « First page 2351 / 2643 Last » Next »