Sciweavers

417 search results - page 81 / 84
» Some Theory for Generalized Boosting Algorithms
Sort
View
STACS
2010
Springer
14 years 2 months ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey
CLEF
2007
Springer
14 years 1 months ago
Multiplying Concept Sources for Graph Modeling
This paper presents the LIG contribution to the CLEF 2007 medical retrieval task (i.e. ImageCLEFmed). The main idea in this paper is to incorporate medical knowledge in the langua...
Loïc Maisonnasse, Éric Gaussier, Jean-...
GLVLSI
2005
IEEE
99views VLSI» more  GLVLSI 2005»
14 years 1 months ago
An empirical study of crosstalk in VDSM technologies
We perform a detailed study of various crosstalk scenarios in VDSM technologies by using a distributed model of the crosstalk site and make a number of key observations about the ...
Shahin Nazarian, Massoud Pedram, Emre Tuncer
SIGIR
2005
ACM
14 years 1 months ago
A study of relevance propagation for web search
Different from traditional information retrieval, both content and structure are critical to the success of Web information retrieval. In recent years, many relevance propagation ...
Tao Qin, Tie-Yan Liu, Xu-Dong Zhang, Zheng Chen, W...
CIKM
2004
Springer
14 years 1 months ago
Node ranking in labeled directed graphs
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...
Krishna Prasad Chitrapura, Srinivas R. Kashyap