Sciweavers

7200 search results - page 381 / 1440
» On the Computational Power of Winner-Take-All
Sort
View
CORR
2006
Springer
136views Education» more  CORR 2006»
15 years 6 months ago
Bargaining over the interference channel
In this paper we study the computation of the Nash bargaining solution for the two players, K frequency bands case, under joint FDM/TDM spectrum allocations and total power constra...
Amir Leshem, Ephraim Zehavi
IJVR
2007
135views more  IJVR 2007»
15 years 6 months ago
Impostors, Pseudo-instancing and Image Maps for GPU Crowd Rendering
— Rendering large crowds of characters requires a great amount of computational power. To increase the efficiency for this render, we propose the use of the graphics processor, i...
Erik Millán, Isaac Rudomín
SAC
2002
ACM
15 years 6 months ago
A modular approach to build structured event-based systems
Event-based systems are developed and used as a coordination model to integrate components in loosely coupled systems. Research and product development focused so far on efficienc...
Ludger Fiege, Gero Mühl, Felix C. Gärtne...
ACL
2009
15 years 4 months ago
System for Querying Syntactically Annotated Corpora
This paper presents a system for querying treebanks. The system consists of a powerful query language with natural support for cross-layer queries, a client interface with a graph...
Petr Pajas, Jan Stepánek
BIRTHDAY
2010
Springer
15 years 3 months ago
QPME 2.0 - A Tool for Stochastic Modeling and Analysis Using Queueing Petri Nets
Abstract Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the model...
Samuel Kounev, Simon Spinner, Philipp Meier