Sciweavers

933 search results - page 49 / 187
» Monotone Complexity of a Pair
Sort
View
DIS
2003
Springer
14 years 2 months ago
Abduction and the Dualization Problem
Computing abductive explanations is an important problem, which has been studied extensively in Artificial Intelligence (AI) and related disciplines. While computing some abductiv...
Thomas Eiter, Kazuhisa Makino
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
14 years 9 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
ICALP
2009
Springer
14 years 9 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
IPMI
2005
Springer
14 years 9 months ago
The Role of Non-Overlap in Image Registration
Here we model the effect of non-overlapping voxels on image registration, and show that a major defect of overlap-only models--their limited capture range--can be alleviated. Theor...
Jonas August, Takeo Kanade
VTC
2006
IEEE
153views Communications» more  VTC 2006»
14 years 2 months ago
Ordinal MDS-Based Localization for Wireless Sensor Networks
— There are various applications in wireless sensor networks which require knowing the relative or actual position of the sensor nodes. Recently, there have been different locali...
Vijayanth Vivekanandan, Vincent W. S. Wong