11 Result(s)
within
Chapter
Nimrod Megiddo
English
-
Chapter and Conference Paper
An Anomaly Detection Approach for Plankton Species Discovery
Plankton is one of the most abundant and diverse class of microscopic organisms inhabiting the Earth. Their enormous intra- and inter-species genetic and phenotypic diversity, coupled with the limited amount o...
-
Chapter and Conference Paper
Efficient Coalition Detection in Traitor Tracing
In this paper we study the traitor tracing problem for re-broadcasting attack. In this attack, instead of building a pirate clone device (or program) based on their secret keys and sell the clone, the attacker...
-
Chapter and Conference Paper
Online Learning with Prior Knowledge
The standard so-called experts algorithms are methods for utilizing a given set of “experts” to make good choices in a sequential decision-making problem. In the standard setting of experts algorithms, the dec...
-
Chapter and Conference Paper
Continuity Properties of Equilibrium Prices and Allocations in Linear Fisher Markets
Continuity of the map** from initial endowments and utilities to equilibria is an essential property for a desirable model of an economy – without continuity, small errors in the observation of parameters of...
-
Chapter and Conference Paper
Integrating a Maximum-Entropy Cardinality Estimator into DB2 UDB
When comparing alternative query execution plans (qeps), a cost-based query optimizer in a relational database management system (rdbms) needs to estimate the selectivity of conjunctive predicates. The optimizer ...
-
Chapter and Conference Paper
Discovery-driven exploration of OLAP data cubes
Analysts predominantly use OLAP data cubes to identify regions of anomalies that may represent problem areas or new opportunities. The current OLAP systems support hypothesis-driven exploration of data cubes t...
-
Chapter
On Probabilistic Machines, Bounded Rationality and Average-Case Complexity
The analogs of pure, mixed and behavior strategies in the context of algorithms are studied. It is shown that probabilistic machines are more powerful than probability distributions over deterministic ones, th...
-
Chapter
A General NP-Completeness Theorem
Blum, Shub, and Smale [2] formalized a model of computation over a general ring. They proved an analogue of Cook’s theorem [3] over the reals. Smale [4] has recently raised the question of existence of NP-comp...
-
Chapter and Conference Paper
New algorithms for generalized network flows
This paper is concerned with generalized network flow problems. In a generalized network, each edge e=(u, v) has a positive “flow multiplier” a e associated with it. The interpretation is that if a flow of x e en...
-
Chapter
Pathways to the Optimal Set in Linear Programming
This chapter presents continuous paths leading to the set of optimal solutions of a linear programming problem. These paths are derived from the weighted logarithmic barrier function. The defining equations ar...
-
Chapter
On the parametric nonlinear complementarity problem
A parametrized version of the nonlinear complementarity problem is formulated. The existence of a continuation of a solution is investigated and sufficient and necessary conditions for the monotonicity of such...
