Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,506
Modeling sequential elimination elections in the U.S. House of Representatives *
, 2001
"... Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at ..."
Abstract
- Add to MetaCart
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at
Sequential data assimilation with a nonlinear quasi-geostrophic model using Monte Carlo methods to forecast error statistics
- J. Geophys. Res
, 1994
"... . A new sequential data assimilation method is discussed. It is based on forecasting the error statistics using Monte Carlo methods, a better alternative than solving the traditional and computationally extremely demanding approximate error covariance equation used in the extended Kalman filter. The ..."
Abstract
-
Cited by 800 (23 self)
- Add to MetaCart
. A new sequential data assimilation method is discussed. It is based on forecasting the error statistics using Monte Carlo methods, a better alternative than solving the traditional and computationally extremely demanding approximate error covariance equation used in the extended Kalman filter
A direct approach to false discovery rates
, 2002
"... Summary. Multiple-hypothesis testing involves guarding against much more complicated errors than single-hypothesis testing. Whereas we typically control the type I error rate for a single-hypothesis test, a compound error rate is controlled for multiple-hypothesis tests. For example, controlling the ..."
Abstract
-
Cited by 775 (14 self)
- Add to MetaCart
the false discovery rate FDR traditionally involves intricate sequential p-value rejection methods based on the observed data. Whereas a sequential p-value method fixes the error rate and estimates its corresponding rejection region, we propose the opposite approach—we fix the rejection region
A Trace-Driven Analysis of the UNIX 4.2 BSD File System
, 1985
"... We analyzed the UNIX 4.2 BSD file system by recording userlevel activity in trace files and writing programs to analyze the traces. The tracer did not record individual read and write operations, yet still provided tight bounds on what information was accessed and when. The trace analysis shows that ..."
Abstract
-
Cited by 277 (5 self)
- Add to MetaCart
that the average file system bandwidth needed per user is low (a few hundred bytes per second). Most of the files accessed are open only a short time and are accessed sequentially. Most new information is deleted or overwritten within a few minutes of its creation. We also wrote a simulator that uses the traces
Speculative Versioning Cache
- In Proceedings of the Fourth International Symposium on High-Performance Computer Architecture
, 1998
"... Dependences among loads and stores whose addresses are unknown hinder the extraction of instruction level parallelism during the execution of a sequential program. Such ambiguous memory dependences can be overcome by memory dependence speculation which enables a load or store to be speculatively exe ..."
Abstract
-
Cited by 207 (8 self)
- Add to MetaCart
Dependences among loads and stores whose addresses are unknown hinder the extraction of instruction level parallelism during the execution of a sequential program. Such ambiguous memory dependences can be overcome by memory dependence speculation which enables a load or store to be speculatively
Sequential Elimination Graphs
"... A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, which is an ordering of the vertices such that, for each vertex v, the neighbors of v that occur later than v in the order ..."
Abstract
-
Cited by 13 (2 self)
- Add to MetaCart
in the ordering form a clique. Akcoglu et al [2] define an extension of chordal graphs whereby the neighbors of v that occur later than v in the elimination order have at most k independent vertices. We refer to such graphs as sequentially k-independent graphs. Clearly this extension of chordal graphs also
elections
, 2002
"... Public review of the XML Forum’s transcript schema has resulted in a reevaluation of earlier approaches. A revision is now being proposed for a more flexible structure on which future schemas can be modeled. When the XML Forum for Education met at the University of Miami, Coral Gables in February 20 ..."
Abstract
- Add to MetaCart
those features which were universally agreed to, but it was anticipated that the Sector libraries would carry most of the burden of refining data definitions, specifying required elements and eliminating data elements that are invalid for the Sector.
Controlling candidate-sequential elections
- In Proceedings of the 20th European Conference on Artificial Intelligence
, 2012
"... ar ..."
Avoiding the disk bottleneck in the data domain deduplication file system
- In Proceedings of the 6th USENIX Conference on File And Storage Technologies
, 2008
"... Disk-based deduplication storage has emerged as the new-generation storage system for enterprise data protection to replace tape libraries. Deduplication removes redundant data segments to compress data into a highly compact form and makes it economical to store backups on disk instead of tape. A cr ..."
Abstract
-
Cited by 163 (1 self)
- Add to MetaCart
crucial requirement for enterprise data protection is high throughput, typically over 100 MB/sec, which enables backups to complete quickly. A significant challenge is to identify and eliminate duplicate data segments at this rate on a low-cost system that cannot afford enough RAM to store an index
The complexity of online manipulation of sequential elections.
- Computing Research Repository,
, 2012
"... ABSTRACT Most work on manipulation assumes that all preferences are known to the manipulators. However, in many settings elections are open and sequential, and manipulators may know the already cast votes but may not know the future votes. We introduce a framework, in which manipulators can see the ..."
Abstract
-
Cited by 6 (3 self)
- Add to MetaCart
ABSTRACT Most work on manipulation assumes that all preferences are known to the manipulators. However, in many settings elections are open and sequential, and manipulators may know the already cast votes but may not know the future votes. We introduce a framework, in which manipulators can see
Results 1 - 10
of
1,506
