Sciweavers

5606 search results - page 381 / 1122
» Randomization Techniques for Graphs.
Sort
View
RTAS
1998
IEEE
15 years 11 months ago
Managing Memory Requirements in the Synthesis of Real-Time Systems from Processing Graphs
In the past, environmental restrictions on size, weight, and power consumption have severely limited both the processing and storage capacity of embedded signal processing systems...
Steve Goddard, Kevin Jeffay
VMV
2008
187views Visualization» more  VMV 2008»
15 years 8 months ago
Patch-Graph Reconstruction for Piecewise Smooth Surfaces
In this paper we present a new surface reconstruction technique for piecewise smooth surfaces from point clouds, such as scans of architectural sites or man-made artifacts. The te...
Philipp Jenke, Michael Wand, Wolfgang Straße...
TAICPART
2010
IEEE
133views Education» more  TAICPART 2010»
15 years 5 months ago
Localizing Defects in Multithreaded Programs by Mining Dynamic Call Graphs
Abstract. Writing multithreaded software for multicore computers confronts many developers with the difficulty of finding parallel programming errors. In the past, most parallel d...
Frank Eichinger, Victor Pankratius, Philipp W. L. ...
ICML
2008
IEEE
16 years 7 months ago
Graph transduction via alternating minimization
Graph transduction methods label input data by learning a classification function that is regularized to exhibit smoothness along a graph over labeled and unlabeled samples. In pr...
Jun Wang, Tony Jebara, Shih-Fu Chang
WWW
2007
ACM
16 years 7 months ago
Dynamic personalized pagerank in entity-relation graphs
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
Soumen Chakrabarti