Sciweavers

10493 search results - page 51 / 2099
» Dynamic Word Problems
Sort
View
IEEEPACT
2000
IEEE
14 years 6 days ago
Exploring the Limits of Sub-Word Level Parallelism
Multimedia instruction set extensions have become a prominent feature in desktop microprocessor platforms, promising superior performance on a wide range of floating-point and int...
Kevin Scott, Jack W. Davidson
OPODIS
2004
13 years 9 months ago
Lock-Free and Practical Doubly Linked List-Based Deques Using Single-Word Compare-and-Swap
Abstract. We present an efficient and practical lock-free implementation of a concurrent deque that supports parallelism for disjoint accesses and uses atomic primitives which are ...
Håkan Sundell, Philippas Tsigas
IPL
2010
114views more  IPL 2010»
13 years 6 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
IAJIT
2007
104views more  IAJIT 2007»
13 years 7 months ago
A Learning-Classification Based Approach for Word Prediction
: Word prediction is an important NLP problem in which we want to predict the correct word in a given context. Word completion utilities, predictive text entry systems, writing aid...
Hisham Al-Mubaid
NAACL
2003
13 years 9 months ago
Target Word Detection and Semantic Role Chunking using Support Vector Machines
In this paper, the automatic labeling of semantic roles in a sentence is considered as a chunking task. We define a semantic chunk as the sequence of words that fills a semantic...
Kadri Hacioglu, Wayne Ward