Sciweavers

281 search results - page 41 / 57
» A revealed preference approach to computational complexity i...
Sort
View
TNN
2010
176views Management» more  TNN 2010»
13 years 3 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
13 years 9 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
CHI
2005
ACM
14 years 9 months ago
Life on the edge: supporting collaboration in location-based experiences
We study a collaborative location-based game in which groups of `lions' hunt together on a virtual savannah that is overlaid on an open playing field. The game implements a s...
Steve Benford, Duncan Rowland, Martin Flintham, Ad...
CSB
2005
IEEE
206views Bioinformatics» more  CSB 2005»
14 years 2 months ago
Bioinformatic Insights from Metagenomics through Visualization
Cutting-edge biological and bioinformatics research seeks a systems perspective through the analysis of multiple types of high-throughput and other experimental data for the same ...
Susan L. Havre, Bobbie-Jo M. Webb-Robertson, Anuj ...
FPGA
2004
ACM
174views FPGA» more  FPGA 2004»
14 years 2 months ago
A compiled accelerator for biological cell signaling simulations
The simulation of large systems of biochemical reactions is a key part of research into molecular signaling and information processing in biological cells. However, it can be impr...
John F. Keane, Christopher Bradley, Carl Ebeling