Sciweavers

146 search results - page 19 / 30
» Formulating context-dependent similarity functions
Sort
View
71
Voted
SIGIR
2010
ACM
14 years 9 months ago
Generalized syntactic and semantic models of query reformulation
We present a novel approach to query reformulation which combines syntactic and semantic information by means of generalized Levenshtein distance algorithms where the substitution...
Amac Herdagdelen, Massimiliano Ciaramita, Daniel M...
CORR
2010
Springer
154views Education» more  CORR 2010»
14 years 9 months ago
Causal Markov condition for submodular information measures
The causal Markov condition (CMC) is a postulate that links observations to causality. It describes the conditional independences among the observations that are entailed by a cau...
Bastian Steudel, Dominik Janzing, Bernhard Sch&oum...
MP
2008
135views more  MP 2008»
14 years 9 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
ICC
2009
IEEE
146views Communications» more  ICC 2009»
14 years 7 months ago
Multi-Hop Aggregate Information Efficiency in Wireless Ad Hoc Networks
Abstract--We introduce multi-hop aggregate information efficiency (MIEA), a comprehensive metric that captures several performance-affecting factors of wireless ad hoc networks in ...
Pedro Henrique Juliano Nardelli, Giuseppe Thadeu F...

Publication
592views
16 years 6 months ago
Coupling Graph Cuts and Level Sets
"This paper presents an efficient algorithm for solving one sort of region-based active contour models, i.e. the active contours without edges model. We develop the link betwe...
Xiang Zeng, Wei Chen, and Qunsheng Peng