Sciweavers

7930 search results - page 72 / 1586
» Greedy in Approximation Algorithms
Sort
View
INFOCOM
2008
IEEE
16 years 17 days ago
Queueing Analysis of Loss Systems with Variable Optical Delay Lines
—Recently, a new optical device called variable optical delay line (VODL) has been proposed in the literature. As suggested by its name, the delay of a VODL can be dynamically se...
Duan-Shin Lee, Cheng-Shang Chang, Jay Cheng, Horng...
ICDM
2007
IEEE
143views Data Mining» more  ICDM 2007»
16 years 14 days ago
Bit Sequences and Biclustering of Text Documents
We propose a new technique for clustering of text documents that relies on a biclustering structure constructed on terms and documents. Our approach makes use of a greedy algorith...
Selim Mimaroglu, Kuniaki Uehara
COMBINATORICS
2002
136views more  COMBINATORICS 2002»
15 years 6 months ago
Minimum Connected Dominating Sets of Random Cubic Graphs
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
William Duckworth
INFOCOM
2000
IEEE
15 years 10 months ago
Broadcast Disks with Polynomial Cost Functions
— In broadcast disk systems, information is broadcasted in a shared medium. When a client needs an item from the disk, it waits until that item is broadcasted. The fundamental al...
Amotz Bar-Noy, Boaz Patt-Shamir, Igor Ziper
SMI
2008
IEEE
108views Image Analysis» more  SMI 2008»
16 years 16 days ago
Variational Multilevel Mesh Clustering
In this paper a novel clustering algorithm is proposed, namely Variational Multilevel Mesh Clustering (VMLC). The algorithm incorporates the advantages of both hierarchical and va...
Iurie Chiosa, Andreas Kolb