Sciweavers

2745 search results - page 119 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
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...
SIGMOD
2009
ACM
191views Database» more  SIGMOD 2009»
16 years 4 months ago
Scalable skyline computation using object-based space partitioning
The skyline operator returns from a set of multi-dimensional objects a subset of superior objects that are not dominated by others. This operation is considered very important in ...
Shiming Zhang, Nikos Mamoulis, David W. Cheung
139
Voted
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
15 years 8 months ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan
CTRSA
2006
Springer
183views Cryptology» more  CTRSA 2006»
15 years 7 months ago
Efficient Doubling on Genus 3 Curves over Binary Fields
The most important and expensive operation in a hyperelliptic curve cryptosystem (HECC) is scalar multiplication by an integer k, i.e., computing an integer k times a divisor D on ...
Xinxin Fan, Thomas J. Wollinger, Yumin Wang
135
Voted
SAC
2010
ACM
15 years 3 months ago
FANGS: high speed sequence mapping for next generation sequencers
Next Generation Sequencing machines are generating millions of short DNA sequences (reads) everyday. There is a need for efficient algorithms to map these sequences to the referen...
Sanchit Misra, Ramanathan Narayanan, Simon Lin, Al...