Sciweavers

6104 search results - page 810 / 1221
» Constructing Information Bases Using Associative Structures
Sort
View
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
15 years 7 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
EVOW
2008
Springer
15 years 8 months ago
Improving Query Expansion with Stemming Terms: A New Genetic Algorithm Approach
Nowadays, searching information in the web or in any kind of document collection has become one of the most frequent activities. However, user queries can be formulated in a way th...
Lourdes Araujo, José R. Pérez-Ag&uum...
ECML
2007
Springer
16 years 13 days ago
Exploiting Term, Predicate, and Feature Taxonomies in Propositionalization and Propositional Rule Learning
Knowledge representations using semantic web technologies often provide information which translates to explicit term and predicate taxonomies in relational learning. We show how t...
Monika Záková, Filip Zelezný
INFOCOM
2005
IEEE
15 years 12 months ago
GPS free coordinate assignment and routing in wireless sensor networks
— In this paper we consider the problem of constructing a coordinate system in a sensor network where location information is not available. To this purpose we introduce the Virt...
Antonio Caruso, Stefano Chessa, Swades De, A. Urpi
208
Voted
WBIR
2010
SPRINGER
15 years 11 months ago
Reliability-Driven, Spatially-Adaptive Regularization for Deformable Registration
We propose a reliability measure that identifies informative image cues useful for registration, and present a novel, data-driven approach to spatially adapt regularization to the...
Lisa Tang, Ghassan Hamarneh, Rafeef Abugharbieh