Sciweavers

779 search results - page 59 / 156
» Algorithms for the Sample Mean of Graphs
Sort
View
ICWE
2005
Springer
15 years 10 months ago
Automatic Optimization of Web Recommendations Using Feedback and Ontology Graphs
Abstract. Web recommendation systems have become a popular means to improve the usability of web sites. This paper describes the architecture of a rulebased recommendation system a...
Nick Golovin, Erhard Rahm
143
Voted
GLVLSI
2002
IEEE
109views VLSI» more  GLVLSI 2002»
15 years 9 months ago
Minimizing resources in a repeating schedule for a split-node data-flow graph
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha
DATE
2008
IEEE
131views Hardware» more  DATE 2008»
15 years 11 months ago
Parametric Throughput Analysis of Synchronous Data Flow Graphs
Synchronous Data Flow Graphs (SDFGs) have proved to be a very successful tool for modeling, analysis and synthesis of multimedia applications targeted at both single- and multiproc...
Amir Hossein Ghamarian, Marc Geilen, Twan Basten, ...
ICRA
2006
IEEE
134views Robotics» more  ICRA 2006»
15 years 10 months ago
Multiresolution Approach for Motion Planning under Differential Constraints
Abstract— In this paper, we present an incremental, multiresolution motion planning algorithm designed for systems with differential constraints. Planning for these sytems is mor...
Stephen R. Lindemann, Steven M. LaValle
BMCBI
2005
94views more  BMCBI 2005»
15 years 4 months ago
Reproducible Clusters from Microarray Research: Whither?
Motivation: In cluster analysis, the validity of specific solutions, algorithms, and procedures present significant challenges because there is no null hypothesis to test and no &...
Nikhil R. Garge, Grier P. Page, Alan P. Sprague, B...