Sciweavers

465 search results - page 74 / 93
» On the Hardness of Range Assignment Problems
Sort
View
137
Voted
USENIX
2001
15 years 3 months ago
A Waypoint Service Approach to Connect Heterogeneous Internet Address Spaces
The rapid growth of the Internet has made IP addresses a scarce resource. To get around this problem, today and in the foreseeable future, networks will be deployed with reusable-...
T. S. Eugene Ng, Ion Stoica, Hui Zhang
BMCBI
2005
114views more  BMCBI 2005»
15 years 1 months ago
A new decoding algorithm for hidden Markov models improves the prediction of the topology of all-beta membrane proteins
Background: Structure prediction of membrane proteins is still a challenging computational problem. Hidden Markov models (HMM) have been successfully applied to the problem of pre...
Piero Fariselli, Pier Luigi Martelli, Rita Casadio
ICDE
2007
IEEE
133views Database» more  ICDE 2007»
16 years 3 months ago
Preference-Aware Query and Update Scheduling in Web-databases
Typical web-database systems receive read-only queries, that generate dynamic web pages as a response, and writeonly updates, that keep information up-to-date. Users expect short ...
Huiming Qu, Alexandros Labrinidis
PODS
2005
ACM
151views Database» more  PODS 2005»
16 years 2 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...
MOBIHOC
2006
ACM
16 years 1 months ago
Balancing distance and lifetime in delay constrained ad hoc networks
This paper addresses the problem of optimizing the packet transmission schedule in an ad hoc network with end-toend delay constraints. The emphasis is to determine the proper rela...
Ben Liang, Min Dong