Results 1  10
of
43,927
Eigentaste: A Constant Time Collaborative Filtering Algorithm
, 2000
"... Eigentaste is a collaborative filtering algorithm that uses universal queries to elicit realvalued user ratings on a common set of items and applies principal component analysis (PCA) to the resulting dense subset of the ratings matrix. PCA facilitates dimensionality reduction for offline clusterin ..."
Abstract

Cited by 378 (6 self)
 Add to MetaCart
clustering of users and rapid computation of recommendations. For a database of n users, standard nearestneighbor techniques require O(n) processing time to compute recommendations, whereas Eigentaste requires O(1) (constant) time. We compare Eigentaste to alternative algorithms using data from Jester
Searching in Constant Time and Minimum Space
, 1995
"... This report deals with techniques for minimal space representation of a subset of elements from a bounded universe so that various types of searches can be performed in constant time. In particular, we introduce a data structure to represent a subset of N elements of [0�:::�M;1] in a number of bits ..."
Abstract

Cited by 11 (8 self)
 Add to MetaCart
This report deals with techniques for minimal space representation of a subset of elements from a bounded universe so that various types of searches can be performed in constant time. In particular, we introduce a data structure to represent a subset of N elements of [0�:::�M;1] in a number of bits
Graph Transformation in Constant Time
"... Abstract. We present conditions under which graph transformation rules can be applied in time independent of the size of the input graph: graphs must contain a unique root label, nodes in the lefthand sides of rules must be reachable from the root, and nodes must have a bounded outdegree. We establ ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
establish a constant upper bound for the time needed to construct all graphs resulting from an application of a fixed rule to an input graph. We also give an improved upper bound under the stronger condition that all edges outgoing from a node must have distinct labels. Then this result is applied
Graph Transformation in Constant Time
, 2006
"... Abstract. We present conditions under which graph transformation rules can be applied in time independent of the size of the input graph: graphs must contain a unique root label, nodes in the lefthand sides of rules must be reachable from the root, and nodes must have a bounded outdegree. We establ ..."
Abstract
 Add to MetaCart
establish a constant upper bound for the time needed to construct all graphs resulting from an application of a fixed rule to an input graph. We also give an improved upper bound under the stronger condition that all edges outgoing from a node must have distinct labels. Then this result is applied
GraphTransformationinConstantTime
"... Abstract. We present conditions under which graph transformation rules can be applied in time independent of the size of the input graph: graphs must contain a unique root label, nodes in the lefthand sides of rules must be reachable from the root, and nodes must have a bounded outdegree. We establ ..."
Abstract
 Add to MetaCart
establish a constant upper bound for the time needed to construct all graphs resulting from an application of a fixed rule to an input graph. We also give an improved upper bound under the stronger condition that all edges outgoing from a node must have distinct labels. Then this result is applied
ConstantTime Solution to the Global . . .
, 2003
"... Aconstanttime solution of the continuous global optimization problem (GOP) is obtained by using an ensemble algorithm. We show that under certain assumptions, the solution can be guaranteed by mapping the GOP onto a discrete unsorted search problem, whereupon Br uschweiler's ensemble search al ..."
Abstract
 Add to MetaCart
Aconstanttime solution of the continuous global optimization problem (GOP) is obtained by using an ensemble algorithm. We show that under certain assumptions, the solution can be guaranteed by mapping the GOP onto a discrete unsorted search problem, whereupon Br uschweiler's ensemble search
Median Filtering in Constant Time
"... Abstract — The median filter is one of the basic building blocks in many image processing situations. However, its use has long been hampered by its algorithmic complexity of O(r) in the kernel radius. With the trend toward larger images and proportionally larger filter kernels, the need for a more ..."
Abstract
 Add to MetaCart
Abstract — The median filter is one of the basic building blocks in many image processing situations. However, its use has long been hampered by its algorithmic complexity of O(r) in the kernel radius. With the trend toward larger images and proportionally larger filter kernels, the need for a more efficient median filtering algorithm becomes pressing. In this correspondence, a new, simple yet much faster algorithm exhibiting O(1) runtime complexity is described and analyzed. It is compared and benchmarked against previous algorithms. Extensions to higherdimensional or higherprecision data and an approximation to a circular kernel are presented as well. Index Terms — Median filters, image processing, algorithms, complexity theory.
ConstantTime Distributed Dominating Set Approximation
 In Proc. of the 22 nd ACM Symposium on the Principles of Distributed Computing (PODC
, 2003
"... Finding a small dominating set is one of the most fundamental problems of traditional graph theory. In this paper, we present a new fully distributed approximation algorithm based on LP relaxation techniques. For an arbitrary parameter k and maximum degree #, our algorithm computes a dominating set ..."
Abstract

Cited by 134 (22 self)
 Add to MetaCart
of expected size O k# log #DSOPT rounds where each node has to send O k messages of size O(log #). This is the first algorithm which achieves a nontrivial approximation ratio in a constant number of rounds.
Constant Time Simulation of an RMesh . . .
, 2007
"... Recently, many parallel computing models using dynamically reconfigurable electrical buses have been proposed in the literature. The underlying characteristics are similar among these models, but they do have certain differences that can take form of restrictions on configurations allowed. This pape ..."
Abstract
 Add to MetaCart
. This paper presents a constant time simulation of an RMesh on an LRMesh (a restricted model of the RMesh), proving that in spite of the differences, the two models possess the same complexity. In other words, the LRMesh can simulate a step of the RMesh in constant time with a polynomial increase in size
A scheduling model for reduced CPU energy
 ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 1995
"... The energy usage of computer systems is becoming an important consideration, especially for batteryoperated systems. Various methods for reducing energy consumption have been investigated, both at the circuit level and at the operating systems level. In this paper, we propose a simple model of job s ..."
Abstract

Cited by 558 (3 self)
 Add to MetaCart
scheduling aimed at capturing some key aspects of energy minimization. In this model, each job is to be executed between its arrival time and deadline by a single processor with variable speed, under the assumption that energy usage per unit time, P, is a convex function of the processor speed s. We give
Results 1  10
of
43,927