Sciweavers

1091 search results - page 198 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
RECOMB
2006
Springer
14 years 8 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
MOBIHOC
2008
ACM
14 years 7 months ago
Dynamic packet fragmentation for wireless channels with failures
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
Predrag R. Jelenkovic, Jian Tan
XSYM
2009
Springer
136views Database» more  XSYM 2009»
14 years 2 months ago
Optimizing XML Compression
Abstract. The eXtensible Markup Language (XML) provides a powerful and flexible means of encoding and exchanging data. As it turns out, its main advantage as an encoding format (n...
Gregory Leighton, Denilson Barbosa
IPSN
2010
Springer
14 years 3 months ago
Online distributed sensor selection
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
Daniel Golovin, Matthew Faulkner, Andreas Krause
WSCG
2003
166views more  WSCG 2003»
13 years 9 months ago
View-Dependent Multiresolution Model For Foliage
Real-time rendering of vegetation is one of the most important challenges in outdoor scenes. This is due to the vast amount of polygons that are used to model vegetable species. M...
Inmaculada Remolar, Miguel Chover, José Rib...