Sciweavers

6020 search results - page 797 / 1204
» A New Approach to Model Counting
Sort
View
KDD
2012
ACM
244views Data Mining» more  KDD 2012»
13 years 9 months ago
Open domain event extraction from twitter
Tweets are the most up-to-date and inclusive stream of information and commentary on current events, but they are also fragmented and noisy, motivating the need for systems that c...
Alan Ritter, Mausam, Oren Etzioni, Sam Clark
ASPLOS
2012
ACM
14 years 2 months ago
Providing safe, user space access to fast, solid state disks
Emerging fast, non-volatile memories (e.g., phase change memories, spin-torque MRAMs, and the memristor) reduce storage access latencies by an order of magnitude compared to state...
Adrian M. Caulfield, Todor I. Mollov, Louis Alex E...
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
16 years 1 months ago
Predicting the readability of short web summaries
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
Tapas Kanungo, David Orr
ESANN
2006
15 years 8 months ago
Random Forests Feature Selection with K-PLS: Detecting Ischemia from Magnetocardiograms
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
Long Han, Mark J. Embrechts, Boleslaw K. Szymanski...
BMCBI
2007
145views more  BMCBI 2007»
15 years 6 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...