Sciweavers

1787 search results - page 81 / 358
» Approximation Techniques for Spatial Data
Sort
View
ESANN
2006
13 years 10 months ago
On the selection of hidden neurons with heuristic search strategies for approximation
Abstract. Feature Selection techniques usually follow some search strategy to select a suitable subset from a set of features. Most neural network growing algorithms perform a sear...
Ignacio Barrio, Enrique Romero, Lluís A. Be...
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 6 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
ICC
2007
IEEE
117views Communications» more  ICC 2007»
14 years 3 months ago
Applying Techniques from Frame Synchronization for Biological Sequence Analysis
— During the last years, the amount of genetic data available has increased rapidly which creates the demand for advanced techniques for their interpretation. In the following, w...
Johanna Weindl, Joachim Hagenauer
WISE
2008
Springer
14 years 3 months ago
Approximate Information Filtering in Peer-to-Peer Networks
Abstract. Most approaches to information filtering taken so far have the underlying hypothesis of potentially delivering notifications from every information producer to subscrib...
Christian Zimmer, Christos Tryfonopoulos, Klaus Be...
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
13 years 10 months ago
A Unified Approach to Approximate Proximity Searching
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...