Sciweavers

1031 search results - page 68 / 207
» Indexing Information for Data Forensics
Sort
View
ALT
2006
Springer
14 years 4 months ago
Smooth Boosting Using an Information-Based Criterion
Abstract. Smooth boosting algorithms are variants of boosting methods which handle only smooth distributions on the data. They are proved to be noise-tolerant and can be used in th...
Kohei Hatano
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
14 years 8 months ago
BLINKS: ranked keyword searches on graphs
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Haixun Wang, Hao He, Jun Yang 0001, Philip S. Yu
CIKM
2004
Springer
14 years 1 months ago
SWAM: a family of access methods for similarity-search in peer-to-peer data networks
Peer-to-peer Data Networks (PDNs) are large-scale, selforganizing, distributed query processing systems. Familiar examples of PDN are peer-to-peer file-sharing networks, which su...
Farnoush Banaei Kashani, Cyrus Shahabi
BMCBI
2004
112views more  BMCBI 2004»
13 years 7 months ago
A double classification tree search algorithm for index SNP selection
Background: In population-based studies, it is generally recognized that single nucleotide polymorphism (SNP) markers are not independent. Rather, they are carried by haplotypes, ...
Peisen Zhang, Huitao Sheng, Ryuhei Uehara
MIR
2004
ACM
92views Multimedia» more  MIR 2004»
14 years 1 months ago
Researchexplorer: gaining insights through exploration in multimedia scientific data
An increasing amount of heterogeneous information about scientific research is becoming available on-line. This potentially allows users to explore the information from multiple p...
Bo Gong, Rahul Singh, Ramesh Jain