Sciweavers

2593 search results - page 464 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
MP
2008
135views more  MP 2008»
13 years 8 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
IJON
1998
102views more  IJON 1998»
13 years 8 months ago
Developments of the generative topographic mapping
The Generative Topographic Mapping (GTM) model was introduced by 7) as a probabilistic re-formulation of the self-organizing map (SOM). It offers a number of advantages compared ...
Christopher M. Bishop, Markus Svensén, Chri...
ICRA
2009
IEEE
126views Robotics» more  ICRA 2009»
13 years 6 months ago
Time-bounded lattice for efficient planning in dynamic environments
For vehicles navigating initially unknown cluttered environments, current state-of-the-art planning algorithms are able to plan and re-plan dynamically-feasible paths efficiently a...
Aleksandr Kushleyev, Maxim Likhachev
ICIP
2004
IEEE
14 years 10 months ago
Scalable coding of variable size blocks motion vectors
In this paper we discuss an algorithm that is able to provide a scalable (multiresolution) representation of the motion field information. It has been recently demonstrated that, ...
Davide Maestroni, Augusto Sarti, Marco Tagliasacch...
SDM
2009
SIAM
223views Data Mining» more  SDM 2009»
14 years 6 months ago
Context Aware Trace Clustering: Towards Improving Process Mining Results.
Process Mining refers to the extraction of process models from event logs. Real-life processes tend to be less structured and more flexible. Traditional process mining algorithms...
R. P. Jagadeesh Chandra Bose, Wil M. P. van der Aa...