Sciweavers

1538 search results - page 189 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
ACL
1994
15 years 2 months ago
An automatic Method of Finding Topic Boundaries
This article outlines a new method of locating discourse boundaries based on lexical cohesion and a graphical technique called dotplotting. The application of dotplotting to disco...
Jeffrey C. Reynar
ICDE
2005
IEEE
103views Database» more  ICDE 2005»
16 years 2 months ago
Vectorizing and Querying Large XML Repositories
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
Peter Buneman, Byron Choi, Wenfei Fan, Robert Hutc...
PPSN
1992
Springer
15 years 5 months ago
Hyperplane Annealing and Activator-Inhibitor-Systems
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...
Thomas Laußermair
PE
2010
Springer
138views Optimization» more  PE 2010»
14 years 12 months ago
Trace data characterization and fitting for Markov modeling
We propose a trace fitting algorithm for Markovian Arrival Processes (MAPs) that can capture statistics of any order of interarrival times between measured events. By studying re...
Giuliano Casale, Eddy Z. Zhang, Evgenia Smirni
STACS
1992
Springer
15 years 5 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...