Sciweavers

2479 search results - page 91 / 496
» A Computational Theory of Working Memory
Sort
View

Book
5396views
15 years 6 months ago
Markov Random Field Modeling in Computer Vision
Markov random field (MRF) theory provides a basis for modeling contextual constraints in visual processing and interpretation. It enables us to develop optimal vision algorithms sy...
Stan Z. Li
FOCS
2008
IEEE
14 years 2 months ago
Computing the Tutte Polynomial in Vertex-Exponential Time
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
ATAL
2006
Springer
13 years 11 months ago
Computational mechanism design for multi-sensor information fusion
Conventional information fusion architectures are challenged by developments in sensor networks that allow individually-owned (and thereby selfish) sensors to interact and share d...
Alex Rogers, Rajdeep K. Dash, Nicholas R. Jennings...
CCS
2005
ACM
14 years 1 months ago
On the cost-ineffectiveness of redundancy in commercial P2P computing
We present a game-theoretic model of the interactions between server and clients in a constrained family of commercial P2P computations (where clients are financially compensated...
Matthew Yurkewych, Brian Neil Levine, Arnold L. Ro...
IPPS
2003
IEEE
14 years 1 months ago
A Compilation Framework for Distributed Memory Parallelization of Data Mining Algorithms
With the availability of large datasets in a variety of scientific and commercial domains, data mining has emerged as an important area within the last decade. Data mining techni...
Xiaogang Li, Ruoming Jin, Gagan Agrawal