Results 1  10
of
1,437,066
Subquadratic algorithms for 3SUM
 In Proc. 9th Worksh. Algorithms & Data Structures, LNCS 3608
, 2005
"... We obtain subquadratic algorithms for 3SUM on integers and rationals in several models. On a standard word RAM with wbit words, we obtain a running time of O(n 2 / max { w lg 2 w, lg 2 n (lg lg n) 2}). In the circuit RAM with one nonstandard AC0 operation, we obtain O(n2 / w2 lg2). In external w me ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
We obtain subquadratic algorithms for 3SUM on integers and rationals in several models. On a standard word RAM with wbit words, we obtain a running time of O(n 2 / max { w lg 2 w, lg 2 n (lg lg n) 2}). In the circuit RAM with one nonstandard AC0 operation, we obtain O(n2 / w2 lg2). In external w
Eliciting selfexplanations improves understanding
 Cognitive Science
, 1994
"... Learning involves the integration of new information into existing knowledge. Generoting explanations to oneself (selfexplaining) facilitates that integration process. Previously, selfexplanation has been shown to improve the acquisition of problemsolving skills when studying workedout examples. ..."
Abstract

Cited by 556 (22 self)
 Add to MetaCart
Learning involves the integration of new information into existing knowledge. Generoting explanations to oneself (selfexplaining) facilitates that integration process. Previously, selfexplanation has been shown to improve the acquisition of problemsolving skills when studying workedout examples
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 565 (0 self)
 Add to MetaCart
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps required by earlier algorithms. First, the paper states the maximum flow problem, gives the FordFulkerson labeling method for its solution, and points out that an improper choice of flow augmenting paths can lead to severe computational difficulties. Then rules of choice that avoid these difficulties are given. We show that, if each flow augmentation is made along an augmenting path having a minimum number of arcs, then a maximum flow in an nnode network will be obtained after no more than ~(n a n) augmentations; and then we show that if each flow change is chosen to produce a maximum increase in the flow value then, provided the capacities are integral, a maximum flow will be determined within at most 1 + logM/(M1) if(t, S) augmentations, wheref*(t, s) is the value of the maximum flow and M is the maximum number of arcs across a cut. Next a new algorithm is given for the minimumcost flow problem, in which all shortestpath computations are performed on networks with all weights nonnegative. In particular, this
Improved algorithms for optimal winner determination in combinatorial auctions and generalizations
, 2000
"... Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NPcomplete and inapproximable, but it was recently shown that optimal search algorithms do very well on average. This paper present ..."
Abstract

Cited by 598 (55 self)
 Add to MetaCart
presents a more sophisticated search algorithm for optimal (and anytime) winner determination, including structural improvements that reduce search tree size, faster data structures, and optimizations at search nodes based on driving toward, identifying and solving tractable special cases. We also uncover
Trade Liberalization, Exit, and Productivity Improvements: Evidence from Chilean Plants
 Review of Economic Studies
, 2002
"... This paper empirically investigates the effects of liberalized trade on plant productivity in the case of Chile. Chile presents an interesting setting to study this relationship since it underwent a massive trade liberalization that significantly exposed its plants to competition from abroad during ..."
Abstract

Cited by 530 (14 self)
 Add to MetaCart
evidence of within plant productivity improvements that can be attributed to a liberalized trade for the plants in the importcompeting sector. In many cases, aggregate productivity improvements stem from the reshuffling of resources and output from less to more efficient producers.
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution to a nonlinear programming relaxation. This relaxation can be interpreted both as a semidefinite program and as an eigenvalue minimization problem. The best previously known approximation algorithms for these problems had performance guarantees of ...
2005 MAFFT version 5: improvement in accuracy of multiple sequence alignment. Nucleic Acids Res
"... The accuracy of multiple sequence alignment program MAFFT has been improved. The new version (5.3) of MAFFT offers new iterative refinement options, HINSi, FINSi and GINSi, in which pairwise alignment information are incorporated into objective function. These new options of MAFFT showed hig ..."
Abstract

Cited by 788 (5 self)
 Add to MetaCart
The accuracy of multiple sequence alignment program MAFFT has been improved. The new version (5.3) of MAFFT offers new iterative refinement options, HINSi, FINSi and GINSi, in which pairwise alignment information are incorporated into objective function. These new options of MAFFT showed
The CONSORT Statement: Revised Recommendations for Improving the Quality of Reports of ParallelGroup Randomised Trials. The Lancet
"... To comprehend the results of a randomized, controlled trial (RCT), readers must understand its design, conduct, analysis, and interpretation. That goal can be achieved only through complete transparency from authors. Despite several decades of educational efforts, the reporting of RCTs needs impr ..."
Abstract

Cited by 759 (15 self)
 Add to MetaCart
improvement. Investigators and editors developed the original CONSORT (Consolidated Standards of Reporting Trials) statement to help authors improve reporting by using a checklist and flow diagram. The revised CONSORT statement presented in this paper incorporates new evidence and addresses some criticisms
Improved methods for building protein models in electron density maps and the location of errors in these models. Acta Crystallogr. sect
 A
, 1991
"... Map interpretation remains a critical step in solving the structure of a macromolecule. Errors introduced at this early stage may persist throughout crystallographic refinement and result in an incorrect structure. The normally quoted crystallographic residual is often a poor description for the q ..."
Abstract

Cited by 1016 (9 self)
 Add to MetaCart
Map interpretation remains a critical step in solving the structure of a macromolecule. Errors introduced at this early stage may persist throughout crystallographic refinement and result in an incorrect structure. The normally quoted crystallographic residual is often a poor description for the quality of the model. Strategies and tools are described that help to alleviate this problem. These simplify the modelbuilding process, quantify the goodness of fit of the model on a perresidue basis and locate possible errors in peptide and sidechain conformations.
Debt, deficits and finite horizons
 Journal of Political Economy
, 1985
"... Weitzman have improved this paper. I thank NSF for financial ..."
Abstract

Cited by 579 (1 self)
 Add to MetaCart
Weitzman have improved this paper. I thank NSF for financial
Results 1  10
of
1,437,066