Sciweavers

2924 search results - page 243 / 585
» Lower Bounds in Distributed Computing
Sort
View
MFCS
2009
Springer
15 years 10 months ago
Future-Looking Logics on Data Words and Trees
In a data word or a data tree each position carries a label from a finite alphabet and a data value from an infinite domain. Over data words we consider the logic LTL↓ 1(F), th...
Diego Figueira, Luc Segoufin
ADC
2006
Springer
136views Database» more  ADC 2006»
15 years 10 months ago
A multi-step strategy for approximate similarity search in image databases
Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for fil...
Paul Wing Hing Kwan, Junbin Gao
ISCAS
1999
IEEE
106views Hardware» more  ISCAS 1999»
15 years 8 months ago
Adaptive minimax filtering via recursive optimal quadratic approximations
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...
S. Gollamudi, Yih-Fang Huang
GD
1997
Springer
15 years 8 months ago
Area Requirements for Drawing Hierarchically Planar Graphs
d Abstract) In this paper, we investigate area requirements for drawing s-t hierarchically planar graphs by straight-lines. Two drawing standards will be discussed: 1) each vertex ...
Xuemin Lin, Peter Eades
FOCS
1998
IEEE
15 years 7 months ago
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential sepa...
Maria Luisa Bonet, Juan Luis Esteban, Nicola Gales...