Sciweavers

568 search results - page 54 / 114
» Developing an Ontology from the Application Up
Sort
View
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
15 years 10 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
CODES
2005
IEEE
15 years 3 months ago
Shift buffering technique for automatic code synthesis from synchronous dataflow graphs
This paper proposes a new efficient buffer management technique called shift buffering for automatic code synthesis from synchronous dataflow graphs (SDF). Two previous buffer man...
Hyunok Oh, Nikil D. Dutt, Soonhoi Ha
KCAP
2005
ACM
15 years 3 months ago
Acquisition and maintenance of constraints in engineering design
The Designers’ Workbench is a system, developed by the Advanced Knowledge Technologies (AKT) consortium to support designers in large organizations, such as RollsRoyce, by makin...
Suraj Ajit, Derek H. Sleeman, David W. Fowler, Dav...
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
15 years 3 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
IAJIT
2010
96views more  IAJIT 2010»
14 years 8 months ago
A Data Mashup for Dynamic Composition of Adaptive Courses
: This paper presents a novel adaptive course composition system that based on mashing up learning content in a web application. The system includes three major components, static ...
Mohammed Al-Zoube, Baha Khasawneh