Sciweavers

44651 search results - page 8664 / 8931
» A Generalization of the Least General Generalization
Sort
View
TCS
1998
15 years 6 months ago
A Uniform Approach to Semi-Dynamic Problems on Digraphs
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
Serafino Cicerone, Daniele Frigioni, Umberto Nanni...
TCS
1998
15 years 6 months ago
Dynamical Recognizers: Real-Time Language Recognition by Analog Computers
We consider a model of analog computation which can recognize various languages in real time. We encode an input word as a point in Rd by composing iterated maps, and then apply i...
Cristopher Moore
SIAMCOMP
2002
152views more  SIAMCOMP 2002»
15 years 6 months ago
Maintaining Stream Statistics over Sliding Windows
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...
Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev...
SIAMJO
2002
133views more  SIAMJO 2002»
15 years 6 months ago
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
Philip E. Gill, Walter Murray, Michael A. Saunders
SIAMJO
2002
142views more  SIAMJO 2002»
15 years 6 months ago
A Complementary Pivoting Approach to the Maximum Weight Clique Problem
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
Alessio Massaro, Marcello Pelillo, Immanuel M. Bom...
« Prev « First page 8664 / 8931 Last » Next »