Results 1  10
of
1,807,646
The dangers of replication and a solution
 IN PROCEEDINGS OF THE 1996 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
, 1996
"... Update anywhereanytimeanyway transactional replication has unstable behavior as the workload scales up: a tenfold increase in nodes and traflc gives a thousand fold increase in deadlocks or reconciliations. Master copy replication (primary copyj schemes reduce this problem. A simple analytic mode ..."
Abstract

Cited by 574 (3 self)
 Add to MetaCart
Update anywhereanytimeanyway transactional replication has unstable behavior as the workload scales up: a tenfold increase in nodes and traflc gives a thousand fold increase in deadlocks or reconciliations. Master copy replication (primary copyj schemes reduce this problem. A simple analytic
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
, 1987
"... In this paper we describe simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys. The schemes are provably secure against any known or chosen message attack ff factoring is difficult ..."
Abstract

Cited by 1026 (1 self)
 Add to MetaCart
In this paper we describe simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys. The schemes are provably secure against any known or chosen message attack ff factoring
Simple solution for the flavor question
 Phys. Lett. A15
, 1996
"... We consider a simple way for solving the flavor question by embedding the threefamiliy Standard Model in a semisimple gauge group extending minimally the weak isospin factor. Quantum chiral anomalies between families of fermions cancel with a matching of the number of families and the number of col ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We consider a simple way for solving the flavor question by embedding the threefamiliy Standard Model in a semisimple gauge group extending minimally the weak isospin factor. Quantum chiral anomalies between families of fermions cancel with a matching of the number of families and the number
NOR A SIMPLE SOLUTION
, 1974
"... Reviewed are research studies and their implications regarding mainstreaming educable mentally retarded (EMR) students. Discussed are studies dealing with topics such as the followino: academic changes, learning potential status (stressing the need for individualization), emotional and social adjust ..."
Abstract
 Add to MetaCart
Reviewed are research studies and their implications regarding mainstreaming educable mentally retarded (EMR) students. Discussed are studies dealing with topics such as the followino: academic changes, learning potential status (stressing the need for individualization), emotional and social adjustment, locus of control (citing the difference between students with high and low learning potential), social acceptance of the EBB (demonstrating that social acceptance does not naturally accompany mainstreaming), teacher attitudinal changes, and factors to consider in integration of the EMR (emphasizing the importance of teacher strategies to foster interaction between students). Listed are nine points to consider in mainstreaming, inlluding the issues of full or parttime integration and selection of students. Provided are approximately 50 references. (CL) Ali...fa..ilia
‘Simple Solutions to Complex
, 2009
"... Matters’: Identifying fundamental principles of Alternative Dispute Resolution in the multinational effort to broker a resolution to the Bougainville ‘Crisis’ ..."
Abstract
 Add to MetaCart
Matters’: Identifying fundamental principles of Alternative Dispute Resolution in the multinational effort to broker a resolution to the Bougainville ‘Crisis’
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 1210 (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
Minimum energy mobile wireless networks
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 1999
"... We describe a distributed positionbased network protocol optimized for minimum energy consumption in mobile wireless networks that support peertopeer communications. Given any number of randomly deployed nodes over an area, we illustrate that a simple local optimization scheme executed at each n ..."
Abstract

Cited by 750 (0 self)
 Add to MetaCart
We describe a distributed positionbased network protocol optimized for minimum energy consumption in mobile wireless networks that support peertopeer communications. Given any number of randomly deployed nodes over an area, we illustrate that a simple local optimization scheme executed at each
Learning with local and global consistency.
 In NIPS,
, 2003
"... Abstract We consider the general problem of learning from labeled and unlabeled data, which is often called semisupervised learning or transductive inference. A principled approach to semisupervised learning is to design a classifying function which is sufficiently smooth with respect to the intr ..."
Abstract

Cited by 669 (21 self)
 Add to MetaCart
to the intrinsic structure collectively revealed by known labeled and unlabeled points. We present a simple algorithm to obtain such a smooth solution. Our method yields encouraging experimental results on a number of classification problems and demonstrates effective use of unlabeled data.
A simple cooperative diversity method based on network path selection
 IEEE J. SELECT. AREAS COMMUN
, 2006
"... Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However, most of the proposed solutions require distributed space–time coding algorithms, the careful design of which is left for future investi ..."
Abstract

Cited by 450 (14 self)
 Add to MetaCart
Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However, most of the proposed solutions require distributed space–time coding algorithms, the careful design of which is left for future
Nonlinear total variation based noise removal algorithms
, 1992
"... A constrained optimization type of numerical algorithm for removing noise from images is presented. The total variation of the image is minimized subject to constraints involving the statistics of the noise. The constraints are imposed using Lagrange multipliers. The solution is obtained using the g ..."
Abstract

Cited by 2279 (51 self)
 Add to MetaCart
the gradientprojection method. This amounts to solving a time dependent partial differential equation on a manifold determined by the constraints. As t ~ 0o the solution converges to a steady state which is the denoised image. The numerical algorithm is simple and relatively fast. The results appear
Results 1  10
of
1,807,646