Sciweavers

4324 search results - page 708 / 865
» A Generalized Representer Theorem
Sort
View
SIGMOD
1990
ACM
122views Database» more  SIGMOD 1990»
15 years 8 months ago
Access Support in Object Bases
In this work access support relataons are introduced as a means for optlmizmg query processing m object-oriented database systems The general idea 1s to mamtam redundant separate ...
Alfons Kemper, Guido Moerkotte
CONEXT
2007
ACM
15 years 8 months ago
A hybrid finite automaton for practical deep packet inspection
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
Michela Becchi, Patrick Crowley
KDD
2010
ACM
214views Data Mining» more  KDD 2010»
15 years 8 months ago
Neighbor query friendly compression of social networks
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
Hossein Maserrat, Jian Pei
SIGIR
2010
ACM
15 years 8 months ago
Query similarity by projecting the query-flow graph
Defining a measure of similarity between queries is an interesting and difficult problem. A reliable query-similarity measure can be used in a variety of applications such as que...
Ilaria Bordino, Carlos Castillo, Debora Donato, Ar...
GECCO
2007
Springer
213views Optimization» more  GECCO 2007»
15 years 8 months ago
Aspects of adaptation in natural and artificial evolution
This work addresses selected aspects of natural evolution, especially of the field of population genetics, that are considered to be meaningful for algorithmic further development...
Michael Affenzeller, Stefan Wagner 0002, Stephan M...