Sciweavers

1670 search results - page 121 / 334
» Fast Computation of Data Correlation Using BDDs
Sort
View
131
Voted
COLING
2010
14 years 10 months ago
Chart Pruning for Fast Lexicalised-Grammar Parsing
Given the increasing need to process massive amounts of textual data, efficiency of NLP tools is becoming a pressing concern. Parsers based on lexicalised grammar formalisms, such...
Yue Zhang 0004, Byung-Gyu Ahn, Stephen Clark, Curt...
AUSDM
2007
Springer
145views Data Mining» more  AUSDM 2007»
15 years 9 months ago
Discovering Frequent Sets from Data Streams with CPU Constraint
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
Xuan Hong Dang, Wee Keong Ng, Kok-Leong Ong, Vince...
CSR
2006
Springer
15 years 6 months ago
Fast Motif Search in Protein Sequence Databases
Regular expression pattern matching is widely used in computational biology. Searching through a database of sequences for a motif (a simple regular expression), or its variations...
Elena Zheleva, Abdullah N. Arslan
HPDC
2007
IEEE
15 years 9 months ago
A fast topology inference: a building block for network-aware parallel processing
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
Tatsuya Shirai, Hideo Saito, Kenjiro Taura
MVA
2007
114views Computer Vision» more  MVA 2007»
15 years 4 months ago
Sign Language Recognition Using Boosted Volumetric Features
This paper proposes a method for sign language recognition that bypasses the need for tracking by classifying the motion directly. The method uses the natural extension of haar li...
Helen Cooper, Richard Bowden