Sciweavers

720 search results - page 140 / 144
» Linear k-arboricities on trees
Sort
View
DRR
2010
13 years 10 months ago
Time and space optimization of document content classifiers
Scaling up document-image classifiers to handle an unlimited variety of document and image types poses serious challenges to conventional trainable classifier technologies. Highly...
Dawei Yin, Henry S. Baird, Chang An
ASPDAC
2008
ACM
154views Hardware» more  ASPDAC 2008»
13 years 9 months ago
Exploring high-speed low-power hybrid arithmetic units at scaled supply and adaptive clock-stretching
Meeting power and performance requirement is a challenging task in high speed ALUs. Supply voltage scaling is promising because it reduces both switching and active power but it al...
Swaroop Ghosh, Kaushik Roy
CSCLP
2008
Springer
13 years 9 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
LREC
2010
180views Education» more  LREC 2010»
13 years 9 months ago
Parsing to Stanford Dependencies: Trade-offs between Speed and Accuracy
We investigate a number of approaches to generating Stanford Dependencies, a widely used semantically-oriented dependency representation. We examine algorithms specifically design...
Daniel Cer, Marie-Catherine de Marneffe, Daniel Ju...
EMNLP
2007
13 years 9 months ago
Bootstrapping Feature-Rich Dependency Parsers with Entropic Priors
One may need to build a statistical parser for a new language, using only a very small labeled treebank together with raw text. We argue that bootstrapping a parser is most promis...
David A. Smith, Jason Eisner