Sciweavers

512 search results - page 51 / 103
» Ranking interesting subgroups
Sort
View
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
14 years 11 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
ALMOB
2007
74views more  ALMOB 2007»
14 years 9 months ago
Evaluating deterministic motif significance measures in protein databases
Background: Assessing the outcome of motif mining algorithms is an essential task, as the number of reported motifs can be very large. Significance measures play a central role in...
Pedro Gabriel Ferreira, Paulo J. Azevedo
JUCS
2008
194views more  JUCS 2008»
14 years 9 months ago
An Application of Meta Search Agent System Based on Semantized Tags for Enhanced Web Searching
: Web searching techniques have been investigated and implemented in many aspects. Particularly, in case of personalization, more important issue is how to manipulate the results r...
Chonggun Kim, JaeYoun Jung, Hyeon-Cheol Zin, Jason...
PC
2007
161views Management» more  PC 2007»
14 years 9 months ago
High performance combinatorial algorithm design on the Cell Broadband Engine processor
The Sony–Toshiba–IBM Cell Broadband Engine (Cell/B.E.) is a heterogeneous multicore architecture that consists of a traditional microprocessor (PPE) with eight SIMD co-process...
David A. Bader, Virat Agarwal, Kamesh Madduri, Seu...
CIKM
2010
Springer
14 years 8 months ago
Collaborative future event recommendation
We demonstrate a method for collaborative ranking of future events. Previous work on recommender systems typically relies on feedback on a particular item, such as a movie, and ge...
Einat Minkov, Ben Charrow, Jonathan Ledlie, Seth J...