Sciweavers

16430 search results - page 275 / 3286
» On Computable Tree Functions
Sort
View
SIROCCO
2008
15 years 8 months ago
Computing Approximate Nash Equilibria in Network Congestion Games
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
Andreas Emil Feldmann, Heiko Röglin, Berthold...
ICPADS
2010
IEEE
15 years 4 months ago
Bandwidth- and Latency-Aware Peer-to-Peer Instant Friendcast for Online Social Networks
Online Social Networks (OSNs) are more and more popular recently; people may through them interact with each other for the purpose of social intercourse. The client/server OSN arch...
Jehn-Ruey Jiang, Chao-Wei Hung, Jih-Wei Wu
ECCV
2008
Springer
16 years 8 months ago
Implementing Decision Trees and Forests on a GPU
We describe a method for implementing the evaluation and training of decision trees and forests entirely on a GPU, and show how this method can be used in the context of object rec...
Toby Sharp
DCC
2005
IEEE
16 years 6 months ago
Lossless Data Compression Using Optimal Tree Machines
We discuss a lossless data compression system that uses fixed Tree Machines to encode data. The idea is to create a sequence of Tree Machines and a robust escape method aimed at p...
Gergely Korodi, Jorma Rissanen, Ioan Tabus
MFCS
2009
Springer
16 years 1 months ago
FO Model Checking on Nested Pushdown Trees
Nested Pushdown Trees are unfoldings of pushdown graphs with an additional jump-relation. These graphs are closely related to collapsible pushdown graphs. They enjoy decidable µ-c...
Alexander Kartzow