Sciweavers

11797 search results - page 165 / 2360
» Recent Developments in the Experimental
Sort
View
WWW
2008
ACM
16 years 7 months ago
Recrawl scheduling based on information longevity
It is crucial for a web crawler to distinguish between ephemeral and persistent content. Ephemeral content (e.g., quote of the day) is usually not worth crawling, because by the t...
Christopher Olston, Sandeep Pandey
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 6 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
RECOMB
2007
Springer
16 years 6 months ago
Design of Compact, Universal DNA Microarrays for Protein Binding Microarray Experiments
Our group has recently developed a compact, universal protein binding microarray (PBM) that can be used to determine the binding preferences of transcription factors (TFs) [1]. Thi...
Anthony A. Philippakis, Aaron M. Qureshi, Michael ...
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
16 years 6 months ago
Scalable join processing on very large RDF graphs
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
Thomas Neumann, Gerhard Weikum
ICSE
2008
IEEE-ACM
16 years 6 months ago
Formal concept analysis applied to fault localization
One time-consuming task in the development of software is debugging. Recent work in fault localization crosschecks traces of correct and failing execution traces, it implicitly se...
Peggy Cellier