Results 1  10
of
5,571
Smooth minimization of nonsmooth functions
 Math. Programming
, 2005
"... In this paper we propose a new approach for constructing efficient schemes for nonsmooth convex optimization. It is based on a special smoothing technique, which can be applied to the functions with explicit maxstructure. Our approach can be considered as an alternative to blackbox minimization. F ..."
Abstract

Cited by 523 (1 self)
 Add to MetaCart
In this paper we propose a new approach for constructing efficient schemes for nonsmooth convex optimization. It is based on a special smoothing technique, which can be applied to the functions with explicit maxstructure. Our approach can be considered as an alternative to blackbox minimization
Equivalence of Least Box Number Coverage and Random Ball Coverage in Statistical Sense
, 2008
"... Least box number coverage problem for calculating the dimension of fractal networks is a NPhard problem. In this paper, we proved that this problem is equivalent to a random ball coverage problem in statistical sense. So when we try to calculate the dimension of a large fractal network, it is not n ..."
Abstract
 Add to MetaCart
Least box number coverage problem for calculating the dimension of fractal networks is a NPhard problem. In this paper, we proved that this problem is equivalent to a random ball coverage problem in statistical sense. So when we try to calculate the dimension of a large fractal network
MetaCost: A General Method for Making Classifiers CostSensitive
 In Proceedings of the Fifth International Conference on Knowledge Discovery and Data Mining
, 1999
"... Research in machine learning, statistics and related fields has produced a wide variety of algorithms for classification. However, most of these algorithms assume that all errors have the same cost, which is seldom the case in KDD prob lems. Individually making each classification learner costsensi ..."
Abstract

Cited by 415 (4 self)
 Add to MetaCart
costsensitive is laborious, and often nontrivial. In this paper we propose a principled method for making an arbitrary classifier costsensitive by wrapping a costminimizing procedure around it. This procedure, called MetaCost, treats the underlying classifier as a black box, requiring no knowledge of its
Software Reflexion Models: Bridging the Gap between Source and HighLevel Models
 IEEE Transactions on Software Engineering
, 1995
"... Software engineers often use highlevel models (for instance, box and arrow sketches) to reason and communicate about an existing software system. One problem with highlevel models is that they are almost always inaccurate with respect to the system's source code. We have developed an approach ..."
Abstract

Cited by 404 (20 self)
 Add to MetaCart
Software engineers often use highlevel models (for instance, box and arrow sketches) to reason and communicate about an existing software system. One problem with highlevel models is that they are almost always inaccurate with respect to the system's source code. We have developed
On the (im)possibility of obfuscating programs
 Lecture Notes in Computer Science
, 2001
"... Informally, an obfuscator O is an (efficient, probabilistic) “compiler ” that takes as input a program (or circuit) P and produces a new program O(P) that has the same functionality as P yet is “unintelligible ” in some sense. Obfuscators, if they exist, would have a wide variety of cryptographic an ..."
Abstract

Cited by 348 (24 self)
 Add to MetaCart
and complexitytheoretic applications, ranging from software protection to homomorphic encryption to complexitytheoretic analogues of Rice’s theorem. Most of these applications are based on an interpretation of the “unintelligibility ” condition in obfuscation as meaning that O(P) is a “virtual black box
Inside the Black Box: What Explains Differences in the Efficiencies of Financial Institutions?
, 1997
"... : Over the past several years, substantial research effort has gone into measuring the efficiency of financial institutions. Many studies have found that inefficiencies are quite large, on the order of 20% or more of total banking industry costs and about half of the industry's potential pro ..."
Abstract

Cited by 260 (24 self)
 Add to MetaCart
and provide new evidence using data on U.S. banks over the period 199095. JEL Classification Numbers: G2, D2, G21, G28, E58, E61, F33 Keywords: Bank, efficiency, cost, profit Inside the Black Box: What Explains Differences in the Efficiencies of Financial Institutions? 1. Introduction Over the past
ICOLLIDE: An interactive and exact collision detection system for largescale environments
 In Proc. of ACM Interactive 3D Graphics Conference
, 1995
"... We present an exact and interactive collision detection system, ICOLLIDE, for largescale environments. Such environments are characterized by the number of objects undergoing rigid motion and the complexity of the models. The algorithm does not assume the objects ’ motions can be expressed as a c ..."
Abstract

Cited by 322 (24 self)
 Add to MetaCart
We present an exact and interactive collision detection system, ICOLLIDE, for largescale environments. Such environments are characterized by the number of objects undergoing rigid motion and the complexity of the models. The algorithm does not assume the objects ’ motions can be expressed as a
How to Go Beyond the BlackBox Simulation Barrier
 In 42nd FOCS
, 2001
"... The simulation paradigm is central to cryptography. A simulator is an algorithm that tries to simulate the interaction of the adversary with an honest party, without knowing the private input of this honest party. Almost all known simulators use the adversary’s algorithm as a blackbox. We present t ..."
Abstract

Cited by 228 (13 self)
 Add to MetaCart
The simulation paradigm is central to cryptography. A simulator is an algorithm that tries to simulate the interaction of the adversary with an honest party, without knowing the private input of this honest party. Almost all known simulators use the adversary’s algorithm as a blackbox. We present
Statistical Methods for Detecting Molecular Adaptation
 RR n\Sigma2848 34 Renzo G. AVESANI
, 2000
"... nally, synonymous and nonsynonymous substitution rates (Box 1) are defined in the context of comparing two DNA sequences, with d S and d N as the numbers of synonymous and nonsynonymous substitutions per site, respectively . Thus, the ratio v 5 d N /d S measures the difference between the two rat ..."
Abstract

Cited by 299 (11 self)
 Add to MetaCart
nally, synonymous and nonsynonymous substitution rates (Box 1) are defined in the context of comparing two DNA sequences, with d S and d N as the numbers of synonymous and nonsynonymous substitutions per site, respectively . Thus, the ratio v 5 d N /d S measures the difference between the two
Efficient collision detection using bounding volume hierarchies of kdops
 IEEE Transactions on Visualization and Computer Graphics
, 1998
"... Abstract—Collision detection is of paramount importance for many applications in computer graphics and visualization. Typically, the input to a collision detection algorithm is a large number of geometric objects comprising an environment, together with a set of objects moving within the environment ..."
Abstract

Cited by 290 (4 self)
 Add to MetaCart
Abstract—Collision detection is of paramount importance for many applications in computer graphics and visualization. Typically, the input to a collision detection algorithm is a large number of geometric objects comprising an environment, together with a set of objects moving within
Results 1  10
of
5,571