Results 1  10
of
924,066
The Sylvester equation and approximate balanced reduction
, 2002
"... The purpose of this paper is to investigate the problem of iterative computation of approximately balanced reduced order systems. The resulting approach is completely automatic once an error tolerance is specified and also yields an error bound. This is to be contrasted with existing projection me ..."
Abstract

Cited by 52 (4 self)
 Add to MetaCart
The purpose of this paper is to investigate the problem of iterative computation of approximately balanced reduced order systems. The resulting approach is completely automatic once an error tolerance is specified and also yields an error bound. This is to be contrasted with existing projection
On approximate balanced biclustering
 The Eleventh International Computing and Combinatorics Conference (COCOON
, 2005
"... In this paper, we consider the socalled balanced biclustering problem for n entities in a suitable space where the number of entities in each cluster is bounded. A special case of the balanced biclustering, where the number of entities in each cluster is fixed, is discussed. We present several al ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper, we consider the socalled balanced biclustering problem for n entities in a suitable space where the number of entities in each cluster is bounded. A special case of the balanced biclustering, where the number of entities in each cluster is fixed, is discussed. We present several
Storage management and caching in PAST, a largescale, persistent peertopeer storage utility
, 2001
"... This paper presents and evaluates the storage management and caching in PAST, a largescale peertopeer persistent storage utility. PAST is based on a selforganizing, Internetbased overlay network of storage nodes that cooperatively route file queries, store multiple replicas of files, and cache a ..."
Abstract

Cited by 804 (23 self)
 Add to MetaCart
additional copies of popular files. In the PAST system, storage nodes and files are each assigned uniformly distributed identifiers, and replicas of a file are stored at nodes whose identifier matches most closely the file’s identifier. This statistical assignment of files to storage nodes approximately
A LinearTime Heuristic for Improving Network Partitions
, 1982
"... An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network. In practice, only a very small number of passes are typically needed, leading to a fast approximation algorithm for mincut partitioning. To d ..."
Abstract

Cited by 524 (0 self)
 Add to MetaCart
An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network. In practice, only a very small number of passes are typically needed, leading to a fast approximation algorithm for mincut partitioning
Evaluating Approximately Balanced ParityDeclustered Data Layouts for Disk Arrays
 in Proceedings of the Fourth Annual Workshop on I/O in Parallel and Distributed Systems
, 1996
"... Paritydeclustered data layouts were developed to reduce the time for online failure recovery in disk arrays. They generally require perfect balancing of reconstruction workload among the disks; this restrictive balance condition makes such data layouts difficult to construct. In this paper, we con ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
consider approximately balanced data layouts, where some variation in the reconstruction workload over the disks is permitted. Such layouts are considerably easier to construct than perfectly balanced layouts. We consider three methods for constructing approximately balanced data layouts, and analyze
ModelDriven Data Acquisition in Sensor Networks
 IN VLDB
, 2004
"... Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" is problematic, however, because sensors do not exhaustively represent the data in the real world. In order to map the raw sensor ..."
Abstract

Cited by 448 (36 self)
 Add to MetaCart
approximations with probabilistic confidences, significantly more efficient to compute in both time and energy. Utilizing the combination of a model and live data acquisition raises the challenging optimization problem of selecting the best sensor readings to acquire, balancing the increase in the confidence
Algorithms for simultaneous sparse approximation. Part II: Convex relaxation
, 2004
"... Abstract. A simultaneous sparse approximation problem requests a good approximation of several input signals at once using different linear combinations of the same elementary signals. At the same time, the problem balances the error in approximation against the total number of elementary signals th ..."
Abstract

Cited by 366 (5 self)
 Add to MetaCart
Abstract. A simultaneous sparse approximation problem requests a good approximation of several input signals at once using different linear combinations of the same elementary signals. At the same time, the problem balances the error in approximation against the total number of elementary signals
Protein homology detection by HMMHMM comparison
 BIOINFORMATICS
, 2005
"... Motivation: Protein homology detection and sequence alignment are at the basis of protein structure prediction, function prediction, and evolution. Results: We have generalized the alignment of protein sequences with a profile hidden Markov model (HMM) to the case of pairwise alignment of profile H ..."
Abstract

Cited by 401 (8 self)
 Add to MetaCart
_SIM for a rate of false positives of 10%. Approximately half of the improvement over the profile–profile comparison methods is attributable to the use of profile HMMs in place of simple profiles. Alignment quality: Higher sensitivity is mirrored by an increased alignment quality. HHsearch produced 1.2, 1
Exact and Approximate Balanced Data Gathering in EnergyConstrained Sensor Networks 1
"... We consider the problem of gathering data from a wireless multihop network of energyconstrained sensor nodes to a common base station. Specifically, we aim to balance the total amount of data received from the sensor network during its lifetime against a requirement of sufficient coverage for all ..."
Abstract
 Add to MetaCart
the sensor locations surveyed. Our main contribution lies in formulating this balanced data gathering task, studying the effects of balancing, and proposing an approximation algorithm for the problem. Based on an LP network flow formulation, we present experimental results on both optimal and approximate
APPROXIMATE BALANCED HALF SAMPLE AND RELATED REPLICATION METHODS FOR IMPUTED SURVEY DATA∗
"... SUMMARY. The balanced half sample (BHS) method is a popular method for variance estimation under stratified multistage sampling. The standard BHS works when two units (or two firststage clusters) are sampled from each stratum and when there is no imputed data. We consider the situation where the fi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
SUMMARY. The balanced half sample (BHS) method is a popular method for variance estimation under stratified multistage sampling. The standard BHS works when two units (or two firststage clusters) are sampled from each stratum and when there is no imputed data. We consider the situation where
Results 1  10
of
924,066