Sciweavers

4714 search results - page 349 / 943
» The Complexity of Iterated Multiplication
Sort
View
UAI
2000
15 years 8 months ago
Nash Convergence of Gradient Dynamics in General-Sum Games
Multi-agent games are becoming an increasingly prevalent formalism for the study of electronic commerceand auctions. The speed at which transactions can take place and the growing...
Satinder P. Singh, Michael J. Kearns, Yishay Manso...
GRIDNETS
2008
15 years 7 months ago
Hop Optimization and Relay Node Selection in Multi-hop Wireless Ad-Hoc Networks
In this paper we propose an efficient approach to determine the optimal hops for multi-hop ad hoc wireless networks. Based on the assumption that nodes use successive interferenc...
Xiaohua Li
DSD
2010
IEEE
135views Hardware» more  DSD 2010»
15 years 7 months ago
An Approximate Maximum Common Subgraph Algorithm for Large Digital Circuits
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
Jochem H. Rutgers, Pascal T. Wolkotte, Philip K. F...
BDA
2007
15 years 8 months ago
Hyperplane Queries in a Feature-Space M-tree for Speeding up Active Learning
In content-based retrieval, relevance feedback (RF) is a noticeable method for reducing the “semantic gap” between the low-level features describing the content and the usually...
Michel Crucianu, Daniel Estevez, Vincent Oria, Jea...
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 6 months ago
On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes
Abstract-- This paper addresses the issue of design of lowrate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which need...
Iryna Andriyanova, Jean-Pierre Tillich