Sciweavers

330 search results - page 65 / 66
» Algorithms for Propositional Model Counting
Sort
View
IR
2010
13 years 3 months ago
Sentence-level event classification in unstructured texts
The ability to correctly classify sentences that describe events is an important task for many natural language applications such as Question Answering (QA) and Text Summarisation....
Martina Naughton, Nicola Stokes, Joe Carthy
JCSS
2008
120views more  JCSS 2008»
13 years 5 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
ICDE
2004
IEEE
137views Database» more  ICDE 2004»
14 years 7 months ago
Selectivity Estimation for XML Twigs
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
RECOMB
2004
Springer
14 years 6 months ago
Mining protein family specific residue packing patterns from protein structure graphs
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
Jun Huan, Wei Wang 0010, Deepak Bandyopadhyay, Jac...
CODES
2008
IEEE
14 years 6 days ago
Static analysis for fast and accurate design space exploration of caches
Application-specific system-on-chip platforms create the opportunity to customize the cache configuration for optimal performance with minimal chip estate. Simulation, in partic...
Yun Liang, Tulika Mitra