Sciweavers

5606 search results - page 248 / 1122
» Randomization Techniques for Graphs.
Sort
View
ACMDIS
2006
ACM
15 years 10 months ago
Randomness as a resource for design
Randomness is being harnessed in the design of some interactive systems. This is observed in random blogs, random web searching, and in particular Apple's iPod Shuffle. Yet t...
Tuck Wah Leong, Frank Vetere, Steve Howard
IDEAS
2007
IEEE
128views Database» more  IDEAS 2007»
16 years 23 days ago
Streaming Random Forests
Many recent applications deal with data streams, conceptually endless sequences of data records, often arriving at high flow rates. Standard data-mining techniques typically assu...
Hanady Abdulsalam, David B. Skillicorn, Patrick Ma...
ICIAP
2009
ACM
16 years 7 months ago
Real-Time Online Video Object Silhouette Extraction Using Graph Cuts on the GPU
Abstract. Being able to find the silhouette of an object is a very important front-end processing step for many high-level computer vision techniques, such as Shape-from-Silhouette...
Zachary A. Garrett, Hideo Saito
SAC
2005
ACM
16 years 1 days ago
Discovering parametric clusters in social small-world graphs
We present a strategy for analyzing large, social small-world graphs, such as those formed by human networks. Our approach brings together ideas from a number of different resear...
Jonathan McPherson, Kwan-Liu Ma, Michael Ogawa
WADT
1998
Springer
15 years 10 months ago
An Algebra of Graph Derivations Using Finite (co-) Limit Double Theories
Graph transformation systems have been introduced for the formal specification of software systems. States are thereby modeled as graphs, and computations as graph derivations acco...
Andrea Corradini, Martin Große-Rhode, Reiko ...