Sciweavers

2635 search results - page 22 / 527
» Algorithms for the Database Layout Problem
Sort
View
DATE
1999
IEEE
162views Hardware» more  DATE 1999»
15 years 6 months ago
MOCSYN: Multiobjective Core-Based Single-Chip System Synthesis
In this paper, we present a system synthesis algorithm, called MOCSYN, which partitions and schedules embedded system specifications to intellectual property cores in an integrate...
Robert P. Dick, Niraj K. Jha
VLDB
1997
ACM
99views Database» more  VLDB 1997»
15 years 6 months ago
Resource Scheduling in Enhanced Pay-Per-View Continuous Media Databases
The enhanced pay-per-view (EPPV) model for providing continuous-media-on-demand(CMOD) services associates with each continuous media clip a display frequency that dependson the cl...
Minos N. Garofalakis, Banu Özden, Abraham Sil...
JGAA
2007
135views more  JGAA 2007»
15 years 2 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
JPDC
2006
134views more  JPDC 2006»
15 years 2 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
WWW
2002
ACM
16 years 3 months ago
A machine learning based approach for table detection on the web
Table is a commonly used presentation scheme, especially for describing relational information. However, table understanding remains an open problem. In this paper, we consider th...
Yalin Wang, Jianying Hu