Sciweavers

224 search results - page 40 / 45
» Syntactic Folding and its Application to the Information Ext...
Sort
View
VLDB
2005
ACM
177views Database» more  VLDB 2005»
14 years 28 days ago
Discovering Large Dense Subgraphs in Massive Graphs
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
David Gibson, Ravi Kumar, Andrew Tomkins
ICML
2004
IEEE
14 years 8 months ago
Training conditional random fields via gradient tree boosting
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
Thomas G. Dietterich, Adam Ashenfelter, Yaroslav B...
CHI
2011
ACM
12 years 11 months ago
Characterizing patient-friendly "micro-explanations"of medical events
Patients’ basic understanding of clinical events has been shown to dramatically improve patient care. We propose that the automatic generation of very short microexplanations, s...
Lauren Wilcox, Dan Morris, Desney S. Tan, Justin G...
ICDE
2012
IEEE
269views Database» more  ICDE 2012»
11 years 10 months ago
A Deep Embedding of Queries into Ruby
—We demonstrate SWITCH, a deep embedding of relational queries into RUBY and RUBY on RAILS. With SWITCH, there is no syntactic or stylistic difference between RUBY programs that ...
Torsten Grust, Manuel Mayr
ESWS
2007
Springer
14 years 1 months ago
Annotating Relationships Between Multiple Mixed-Media Digital Objects by Extending Annotea
Annotea provides an annotation protocol to support collaborative Semantic Web-based annotation of digital resources accessible through the Web. It provides a model whereby a user m...
Ronald Schroeter, Jane Hunter, Andrew Newman