Sciweavers

730 search results - page 94 / 146
» Combinatorics of Monotone Computations
Sort
View
SIGECOM
2010
ACM
156views ECommerce» more  SIGECOM 2010»
14 years 14 days ago
Robust mechanisms for risk-averse sellers
The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good ...
Mukund Sundararajan, Qiqi Yan
PODS
1989
ACM
129views Database» more  PODS 1989»
13 years 11 months ago
The Alternating Fixpoint of Logic Programs with Negation
The alternating xpoint of a logic program with negation is de ned constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least xp...
Allen Van Gelder
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
13 years 11 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
ACL
2010
13 years 5 months ago
Unsupervised Search for the Optimal Segmentation for Statistical Machine Translation
We tackle the previously unaddressed problem of unsupervised determination of the optimal morphological segmentation for statistical machine translation (SMT) and propose a segmen...
Coskun Mermer, Ahmet Afsn Akn
CVPR
2009
IEEE
1378views Computer Vision» more  CVPR 2009»
15 years 1 months ago
A Novel Feature Descriptor Invariant to Complex Brightness Changes
We describe a novel and robust feature descriptor called ordinal spatial intensity distribution (OSID) which is invariant to any monotonically increasing brightness changes. Many t...
Feng Tang, Suk Hwan Lim, Nelson L. Chang, Hai Tao