Sciweavers

903 search results - page 141 / 181
» Non-well-founded trees in categories
Sort
View
93
Voted
KDD
2003
ACM
116views Data Mining» more  KDD 2003»
16 years 2 months ago
XRules: an effective structural classifier for XML data
XML documents have recently become ubiquitous because of their varied applicability in a number of applications. Classification is an important problem in the data mining domain, ...
Mohammed Javeed Zaki, Charu C. Aggarwal
POPL
2008
ACM
16 years 2 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
POPL
2007
ACM
16 years 2 months ago
Context logic as modal logic: completeness and parametric inexpressivity
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
16 years 2 months ago
Approximate max-integral-flow/min-multicut theorems
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
Kenji Obata
SIGMOD
2009
ACM
218views Database» more  SIGMOD 2009»
16 years 2 months ago
Exploring biomedical databases with BioNav
We demonstrate the BioNav system, a novel search interface for biomedical databases, such as PubMed. BioNav enables users to navigate large number of query results by categorizing...
Abhijith Kashyap, Vagelis Hristidis, Michalis Petr...