Sciweavers

1523 search results - page 113 / 305
» The Computational Complexity of Linear Optics
Sort
View
VLDB
2007
ACM
129views Database» more  VLDB 2007»
14 years 10 months ago
Efficient Skyline Computation over Low-Cardinality Domains
Current skyline evaluation techniques follow a common paradigm that eliminates data elements from skyline consideration by finding other elements in the dataset that dominate them...
Michael D. Morse, Jignesh M. Patel, H. V. Jagadish
ICRA
2005
IEEE
145views Robotics» more  ICRA 2005»
14 years 3 months ago
Computation and Graphical Characterization of Robust Multiple-Contact Postures in 2D Gravitational Environments
— This paper is concerned with the problem of identifying robust equilibrium postures of a planar mechanism supported by fixed frictional contacts in a twodimensional gravitation...
Yizhar Or, Elon Rimon
ISCAS
2003
IEEE
124views Hardware» more  ISCAS 2003»
14 years 3 months ago
Convergent transfer subgraph characterization and computation
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
Wing Ning Li
IJCAI
2003
13 years 11 months ago
Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. ...
CVIU
2008
109views more  CVIU 2008»
13 years 10 months ago
Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primal-dual st
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios