Sciweavers

982 search results - page 104 / 197
» Solving Steiner tree problems in graphs to optimality
Sort
View
92
Voted
IPPS
2005
IEEE
15 years 6 months ago
Broadcast Trees for Heterogeneous Platforms
In this paper, we deal with broadcasting on heterogeneous platforms. Typically, the message to be broadcast is split into several slices, which are sent by the source processor in...
Olivier Beaumont, Loris Marchal, Yves Robert
96
Voted
RECOMB
2005
Springer
16 years 29 days ago
Reconstruction of Reticulate Networks from Gene Trees
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...
Daniel H. Huson, Tobias H. Klöpper, Pete J. L...
111
Voted
IPSN
2009
Springer
15 years 7 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
135
Voted
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
15 years 2 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
119
Voted
CORR
2011
Springer
205views Education» more  CORR 2011»
14 years 4 months ago
Algorithms for Implicit Hitting Set Problems
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
Karthekeyan Chandrasekaran, Richard Karp, Erick Mo...