Sciweavers

933 search results - page 50 / 187
» Monotone Complexity of a Pair
Sort
View
ICVS
1999
Springer
14 years 1 months ago
Action Reaction Learning: Automatic Visual Analysis and Synthesis of Interactive Behaviour
We propose Action-Reaction Learning as an approach for analyzing and synthesizing human behaviour. This paradigm uncovers causal mappings between past and future events or between...
Tony Jebara, Alex Pentland
IPCO
2010
148views Optimization» more  IPCO 2010»
13 years 10 months ago
Prize-Collecting Steiner Network Problems
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
NIPS
2008
13 years 10 months ago
An Online Algorithm for Maximizing Submodular Functions
We present an algorithm for solving a broad class of online resource allocation . Our online algorithm can be applied in environments where abstract jobs arrive one at a time, and...
Matthew J. Streeter, Daniel Golovin
IJSNET
2006
170views more  IJSNET 2006»
13 years 8 months ago
Ordinal MDS-based localisation for wireless sensor networks
: There are various applications in wireless sensor networks which require knowing the relative or actual position of the sensor nodes. Over the past few years, there have been dif...
Vijayanth Vivekanandan, Vincent W. S. Wong
COCOON
2007
Springer
14 years 3 months ago
The Informational Content of Canonical Disjoint NP-Pairs
We investigate the connection between propositional proof systems and their canonical pairs. It is known that simulations between proof systems translate to reductions between the...
Christian Glaßer, Alan L. Selman, Liyu Zhang