Sciweavers

21 search results - page 3 / 5
» Fast Exhaustive Search for Polynomial Systems in F2
Sort
View
LREC
2010
157views Education» more  LREC 2010»
13 years 7 months ago
Indexing Methods for Faster and More Effective Person Name Search
This paper compares several indexing methods for person names extracted from text, developed for an information retrieval system with requirements for fast approximate matching of...
Mark Arehart
CVPR
2005
IEEE
14 years 8 months ago
Fast Spatial Pattern Discovery Integrating Boosting with Constellations of Contextual Descriptors
We present a novel approach for fast object class recognition incorporating contextual information into boosting. The object is represented as a constellation of generalized corre...
Jaume Amores, Nicu Sebe, Petia Radeva
DFT
2003
IEEE
64views VLSI» more  DFT 2003»
13 years 11 months ago
Hybrid BIST Time Minimization for Core-Based Systems with STUMPS Architecture
1 This paper presents a solution to the test time minimization problem for core-based systems that contain sequential cores with STUMPS architecture. We assume a hybrid BIST approa...
Gert Jervan, Petru Eles, Zebo Peng, Raimund Ubar, ...
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
14 years 8 days ago
A particle swarm algorithm for symbols detection in wideband spatial multiplexing systems
This paper explores the application of the particle swarm algorithm for a NP-hard problem in the area of wireless communications. The specific problem is of detecting symbols in a...
Adnan Ahmed Khan, Muhammad Naeem, Syed Ismail Shah
EDBT
2002
ACM
188views Database» more  EDBT 2002»
14 years 6 months ago
Approximate Processing of Multiway Spatial Joins in Very Large Databases
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
Dimitris Papadias, Dinos Arkoumanis