Sciweavers

117 search results - page 22 / 24
» On the directed Full Degree Spanning Tree problem
Sort
View
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
15 years 3 months ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...
ISCAS
2008
IEEE
217views Hardware» more  ISCAS 2008»
15 years 3 months ago
Approximate L0 constrained non-negative matrix and tensor factorization
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
Morten Mørup, Kristoffer Hougaard Madsen, L...
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
15 years 3 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
BMCBI
2006
159views more  BMCBI 2006»
14 years 9 months ago
MultiSeq: unifying sequence and structure data for evolutionary analysis
Background: Since the publication of the first draft of the human genome in 2000, bioinformatic data have been accumulating at an overwhelming pace. Currently, more than 3 million...
Elijah Roberts, John Eargle, Dan Wright, Zaida Lut...
SPAA
2005
ACM
15 years 3 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...