Sciweavers

807 search results - page 31 / 162
» Competition Adds Complexity
Sort
View
NN
2006
Springer
234views Neural Networks» more  NN 2006»
14 years 9 months ago
Attention in natural scenes: Neurophysiological and computational bases
How does attention operate in natural scenes? We show that the receptive fields of inferior temporal cortex neurons that implement object representations become small and located ...
Edmund T. Rolls, Gustavo Deco
HM
2007
Springer
135views Optimization» more  HM 2007»
15 years 3 months ago
Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem
This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-co...
Igor Pesek, Andrea Schaerf, Janez Zerovnik
ICRA
2006
IEEE
121views Robotics» more  ICRA 2006»
15 years 3 months ago
Online Trajectory Generation for Omnidirectional Biped Walking
Abstract— This paper describes the online generation of trajectories for omnidirectional walking on two legs. The gait can be parameterized using walking direction, walking speed...
Sven Behnke
STOC
2003
ACM
96views Algorithms» more  STOC 2003»
15 years 10 months ago
Optimal oblivious routing in polynomial time
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, H...
83
Voted
ICDAR
2007
IEEE
15 years 4 months ago
Performance Analysis Framework for Layout Analysis Methods
This paper presents a new framework for in-depth analysis of the performance of layout analysis methods. Contrary to existing approaches aimed at evaluation or benchmarking, the p...
Apostolos Antonacopoulos, David Bridson