Sciweavers

4560 search results - page 912 / 912
» Finding Data in the Neighborhood
Sort
View
WWW
2007
ACM
14 years 5 months ago
Netprobe: a fast and scalable system for fraud detection in online auction networks
Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implemen...
Shashank Pandit, Duen Horng Chau, Samuel Wang, Chr...
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 5 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
MOBISYS
2010
ACM
13 years 7 months ago
Augmenting mobile 3G using WiFi
We investigate if WiFi access can be used to augment 3G capacity in mobile environments. We first conduct a detailed study of 3G and WiFi access from moving vehicles, in three dif...
Aruna Balasubramanian, Ratul Mahajan, Arun Venkata...
BMCBI
2010
90views more  BMCBI 2010»
13 years 5 months ago
PuTmiR: A database for extracting neighboring transcription factors of human microRNAs
Background: Some of the recent investigations in systems biology have revealed the existence of a complex regulatory network between genes, microRNAs (miRNAs) and transcription fa...
Sanghamitra Bandyopadhyay, Malay Bhattacharyya
BMCBI
2008
139views more  BMCBI 2008»
13 years 5 months ago
A topological transformation in evolutionary tree search methods based on maximum likelihood combining p-ECR and neighbor joinin
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
Maozu Guo, Jian-Fu Li, Yang Liu