Sciweavers

2487 search results - page 242 / 498
» Partitions of Graphs into Trees
Sort
View
VISUALIZATION
1996
IEEE
15 years 8 months ago
Real-Time Incremental Visualization of Dynamic Ultrasound Volumes Using Parallel BSP Trees
We present a method for producing real-time volume visualizations of continuously captured, arbitrarily-oriented 2D arrays (slices) of data. Our system constructs a 3D representat...
William F. Garrett, Henry Fuchs, Mary C. Whitton, ...
161
Voted
DCC
2005
IEEE
16 years 3 months ago
The Combinatorics of Dom de Caen
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
Edwin R. van Dam
INFOCOM
2009
IEEE
15 years 10 months ago
A Social Network Based Patching Scheme for Worm Containment in Cellular Networks
Abstract—Recently, cellular phone networks have begun allowing third-party applications to run over certain open-API phone operating systems such as Windows Mobile, Iphone and Go...
Zhichao Zhu, Guohong Cao, Sencun Zhu, Supranamaya ...
112
Voted
AAIM
2007
Springer
116views Algorithms» more  AAIM 2007»
15 years 10 months ago
Solving Generalized Maximum Dispersion with Linear Programming
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
Gerold Jäger, Anand Srivastav, Katja Wolf
COMPGEOM
1995
ACM
15 years 7 months ago
Representation and Computation of Boolean Combinations of Sculptured Models
We outline an algorithm and implementation of a system that computes Boolean combinations of sculptured solids. We represent the surface of the solids in terms of trimmed and untr...
Shankar Krishnan, Atul Narkhede, Dinesh Manocha