Sciweavers

2626 search results - page 369 / 526
» The complexity of stochastic sequences
Sort
View
ICANN
1997
Springer
15 years 10 months ago
Topology Representing Networks for Intrinsic Dimensionality Estimation
Abstract. In this paper we compare two methods for intrinsic dimensionality (ID) estimation based on optimally topology preserving maps (OTPMs). The rst one is a direct approach, w...
Jörg Bruske, Gerald Sommer
ICPR
2010
IEEE
15 years 8 months ago
Recognizing Human Actions Using Key Poses
In this paper, we explore the idea of using only pose, without utilizing any temporal information, for human action recognition. In contrast to the other studies using complex acti...
Sermetcan Baysal, Mehmet Can Kurt, Pinar Duygulu
ATAL
2008
Springer
15 years 8 months ago
Comparing winner determination algorithms for mixed multi-unit combinatorial auctions
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
Brammert Ottens, Ulle Endriss
DIALM
2008
ACM
168views Algorithms» more  DIALM 2008»
15 years 8 months ago
Local broadcasting in the physical interference model
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
Olga Goussevskaia, Thomas Moscibroda, Roger Watten...
IJCAI
2003
15 years 8 months ago
Incremental Tractable Reasoning about Qualitative Temporal Constraints
In many applications of temporal reasoning we are in­ terested in reasoning incrementally In particular, given a CSP of temporal constrains and a new constraint, we want to maint...
Alfonso Gerevini