Sciweavers

597 search results - page 94 / 120
» Open problems in data collection networks
Sort
View
BMCBI
2010
135views more  BMCBI 2010»
13 years 7 months ago
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models
Background: Genomic data provide a wealth of new information for phylogenetic analysis. Yet making use of this data requires phylogenetic methods that can efficiently analyze extr...
Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulens...
GLOBECOM
2006
IEEE
14 years 1 months ago
AR-PIN/PDC: Flexible Advance Reservation of Intradomain and Interdomain Lightpaths
— A collection of Grid computing resources interconnected by an application-configurable network of lightpaths is called a LambdaGrid. It provides data-intensive applications wit...
Eric He, Xi Wang, Venkatram Vishwanath, Jason Leig...
MOBIHOC
2009
ACM
14 years 8 months ago
Delay and effective throughput of wireless scheduling in heavy traffic regimes: vacation model for complexity
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
Yung Yi, Junshan Zhang, Mung Chiang
ICANN
2011
Springer
12 years 11 months ago
Semi-supervised Learning for WLAN Positioning
Currently the most accurate WLAN positioning systems are based on the fingerprinting approach, where a “radio map” is constructed by modeling how the signal strength measureme...
Teemu Pulkkinen, Teemu Roos, Petri Myllymäki
PODS
2006
ACM
134views Database» more  PODS 2006»
14 years 7 months ago
Approximate quantiles and the order of the stream
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
Sudipto Guha, Andrew McGregor