Sciweavers

48 search results - page 4 / 10
» The Minimum Number of Monotone Subsequences
Sort
View
SODA
2008
ACM
83views Algorithms» more  SODA 2008»
13 years 7 months ago
Splay trees, Davenport-Schinzel sequences, and the deque conjecture
We introduce a new technique to bound the asymptotic performance of splay trees. The basic idea is to transcribe, in an indirect fashion, the rotations performed by the splay tree...
Seth Pettie
ICALP
2009
Springer
14 years 6 months ago
Limiting Negations in Formulas
Negation-limited circuits have been studied as a circuit model between general circuits and monotone circuits. In this paper, we consider limiting negations in formulas. The minimu...
Hiroki Morizumi
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
13 years 11 months ago
A new strategy for querying priced information
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
Ferdinando Cicalese, Eduardo Sany Laber
AAIM
2010
Springer
181views Algorithms» more  AAIM 2010»
13 years 9 months ago
Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
Binhai Zhu
ICCAD
2006
IEEE
101views Hardware» more  ICCAD 2006»
13 years 11 months ago
Thermal-induced leakage power optimization by redundant resource allocation
Traditionally, at early design stages, leakage power is associated with the number of transistors in a design. Hence, intuitively an implementation with minimum resource usage wou...
Min Ni, Seda Ogrenci Memik