Sciweavers

7504 search results - page 178 / 1501
» Computing with Action Potentials
Sort
View
FOCS
1991
IEEE
15 years 5 months ago
Computing Sums of Radicals in Polynomial Time
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...
Johannes Blömer
COLING
1996
15 years 3 months ago
A Unified Theory of Irony and Its Computational Formalization
This paper presents a unified theory of verbal irony tbr developing a computational model of irony. The theory claims that an ironic utterance implicitly communicates the fact tha...
Akira Utsumi
AAAI
2011
14 years 2 months ago
Towards Large-Scale Collaborative Planning: Answering High-Level Search Queries Using Human Computation
Behind every search query is a high-level mission that the user wants to accomplish. While current search engines can often provide relevant information in response to well-speciļ...
Edith Law, Haoqi Zhang
HICSS
2009
IEEE
122views Biometrics» more  HICSS 2009»
15 years 9 months ago
GrayWulf: Scalable Software Architecture for Data Intensive Computing
Big data presents new challenges to both cluster infrastructure software and parallel application design. We present a set of software services and design principles for data inte...
Yogesh Simmhan, Roger S. Barga, Catharine van Inge...
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
15 years 7 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman