Sciweavers

285 search results - page 36 / 57
» New Ways to Construct Binary Search Trees
Sort
View
EDBT
2009
ACM
277views Database» more  EDBT 2009»
15 years 4 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
80
Voted
GFKL
2005
Springer
142views Data Mining» more  GFKL 2005»
15 years 5 months ago
Near Similarity Search and Plagiarism Analysis
Abstract. Existing methods to text plagiarism analysis mainly base on “chunking”, a process of grouping a text into meaningful units each of which gets encoded by an integer nu...
Benno Stein, Sven Meyer zu Eissen
HSNMC
2004
Springer
125views Multimedia» more  HSNMC 2004»
15 years 5 months ago
A Pull-Based Approach for a VoD Service in P2P Networks
We study a new approach to provide an efficient VoD service to a large client population in P2P networks. Previous work has suggested to construct a multicast tree to distribute t...
Anwar Al Hamra, Ernst W. Biersack, Guillaume Urvoy...
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
15 years 3 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley
TPHOL
1999
IEEE
15 years 4 months ago
Universal Algebra in Type Theory
We present a development of Universal Algebra inside Type Theory, formalized using the proof assistant Coq. We define the notion of a signature and of an algebra over a signature. ...
Venanzio Capretta