Sciweavers

1884 search results - page 93 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
COMPGEOM
1994
ACM
15 years 4 months ago
Computing Many Faces in Arrangements of Lines and Segments
We present randomized algorithms for computing many faces in an arrangement of lines or of segments in the plane, which are considerably simpler and slightly faster than the previo...
Pankaj K. Agarwal, Jirí Matousek, Otfried S...
DISOPT
2007
155views more  DISOPT 2007»
14 years 12 months ago
Linear-programming design and analysis of fast algorithms for Max 2-CSP
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
Alexander D. Scott, Gregory B. Sorkin
ISCAS
2005
IEEE
101views Hardware» more  ISCAS 2005»
15 years 5 months ago
Parallel algorithm for hardware implementation of inverse halftoning
— A Parallel algorithm and its hardware implementation of Inverse Halftone operation is proposed in this paper. The algorithm is based on Lookup Tables from which the inverse hal...
Umair F. Siddiqi, Sadiq M. Sait, Aamir A. Farooqui
RECSYS
2010
ACM
15 years 2 days ago
Recommending based on rating frequencies
Since the development of the comparably simple neighborhood-based methods in the 1990s, a plethora of techniques has been developed to improve various aspects of collaborative fil...
Fatih Gedikli, Dietmar Jannach
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
15 years 9 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu