Sciweavers

921 search results - page 98 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
AINA
2009
IEEE
15 years 11 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
14 years 8 months ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi
GECCO
2007
Springer
314views Optimization» more  GECCO 2007»
15 years 10 months ago
Variable selection for wind power prediction using particle swarm optimization
Wind energy has an increasing influence on the energy supply in many countries, but in contrast to conventional power plants it is a fluctuating energy source. For its integration...
René Jursa
CVPR
2009
IEEE
16 years 11 months ago
StaRSaC: Stable Random Sample Consensus for Parameter Estimation
We address the problem of parameter estimation in presence of both uncertainty and outlier noise. This is a common occurrence in computer vision: feature localization is perform...
Jongmoo Choi, Gérard G. Medioni
CICLING
2005
Springer
15 years 10 months ago
Incremental Information Extraction Using Tree-Based Context Representations
Abstract. The purpose of information extraction (IE) is to find desired pieces of information in natural language texts and store them in a form that is suitable for automatic pro...
Christian Siefkes