Sciweavers

1129 search results - page 109 / 226
» Modular Ranking Abstraction
Sort
View
CAEPIA
2011
Springer
14 years 6 months ago
A Cluster Based Pseudo Feedback Technique Which Exploits Good and Bad Clusters
Abstract. In the last years, cluster based retrieval has been demonstrated as an effective tool for both interactive retrieval and pseudo relevance feedback techniques. In this pa...
Javier Parapar, Alvaro Barreiro
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
15 years 8 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
DAC
2005
ACM
16 years 7 months ago
Operator-based model-order reduction of linear periodically time-varying systems
eriodically time-varying (LPTV) abstractions are useful for a variety of communication and computer subsystems. In this paper, we present a novel operator-based model-order reduct...
Yayun Wan, Jaijeet S. Roychowdhury
WWW
2004
ACM
16 years 7 months ago
A semantic approach for designing business protocols
Business processes involve interactions among autonomous partners. We propose that these interactions be specified modularly as protocols. Protocols can be published, enabling imp...
Ashok U. Mallya, Munindar P. Singh
CADE
2009
Springer
16 years 7 months ago
Ground Interpolation for Combined Theories
Abstract. We give a method for modular generation of ground interpolants in modern SMT solvers supporting multiple theories. Our method uses a novel algorithm to modify the proof t...
Amit Goel, Sava Krstic, Cesare Tinelli