Sciweavers

10608 search results - page 1961 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
ALT
1995
Springer
14 years 1 months ago
Learning Unions of Tree Patterns Using Queries
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
ICDT
1995
ACM
96views Database» more  ICDT 1995»
14 years 1 months ago
On Two Forms of Structural Recursion
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
Dan Suciu, Limsoon Wong
ISSS
1995
IEEE
161views Hardware» more  ISSS 1995»
14 years 1 months ago
Synthesis of pipelined DSP accelerators with dynamic scheduling
To construct complete systems on silicon, application speci c DSP accelerators are needed to speed up the execution of high throughput DSP algorithms. In this paper, a methodology...
Patrick Schaumont, Bart Vanthournout, Ivo Bolsens,...
SC
1995
ACM
14 years 1 months ago
Analysis of Multilevel Graph Partitioning
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide ...
George Karypis, Vipin Kumar
WCRE
1995
IEEE
14 years 1 months ago
Pattern Matching for Design Concept Localization
A legacy system is an operational, large-scale software system that is maintained beyond its first generation of programmers. It typically represents a massive economic investmen...
Kostas Kontogiannis, Renato de Mori, Morris Bernst...
« Prev « First page 1961 / 2122 Last » Next »