Sciweavers

2880 search results - page 80 / 576
» Approximate Range Searching
Sort
View
TC
2008
15 years 6 months ago
Efficient Approximate Wordlength Optimization
In this paper, the problem of finding good wordlength combinations for fixed-point digital signal processing flowgraphs is addressed. By formulating and solving an approximate opti...
Paul D. Fiore
CDC
2009
IEEE
208views Control Systems» more  CDC 2009»
15 years 7 months ago
Sensor selection for hypothesis testing in wireless sensor networks: a Kullback-Leibler based approach
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...
Dragana Bajovic, Bruno Sinopoli, João Xavie...
WWW
2009
ACM
16 years 6 months ago
Exploiting web search engines to search structured databases
Web search engines often federate many user queries to relevant structured databases. For example, a product related query might be federated to a product database containing thei...
Arnd Christian König, Dong Xin, Kaushik Chakr...
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
15 years 11 months ago
Ant Colony Programming for Approximation Problems
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...
Mariusz Boryczka, Zbigniew J. Czech, Wojciech Wiec...
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
15 years 6 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro