Sciweavers

231 search results - page 13 / 47
» A Case Study on Moves and Mergers
Sort
View
IEEECIT
2010
IEEE
13 years 6 months ago
Non-recursive Algorithm of Tower of Hanoi Problem
—As we all know, Hanoi Problem is a classical case of recursive algorithm in programming. In this paper, we study the problem in another way by numbering the peg from bottom to t...
Fuwan Ren, Qifan Yang, Jiexin Zheng, Hui Yan
ICCV
1995
IEEE
13 years 11 months ago
A Multi-Body Factorization Method for Motion Analysis
The structure-from-motion problem has been extensively studied in the field of computer vision. Yet, the bulk of the existing work assumes that the scene contains only a single m...
João Paulo Costeira, Takeo Kanade
FOSSACS
2010
Springer
13 years 11 months ago
Degrees of Lookahead in Regular Infinite Games
We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. The second player may postpone a move for a f...
Michael Holtmann, Lukasz Kaiser, Wolfgang Thomas
SPE
2010
167views more  SPE 2010»
13 years 6 months ago
Comparing practices for reuse in integration-oriented software product lines and large open source software projects
Abstract. This paper compares organization and practices for software reuse in integrationoriented software product lines and open source software projects. The main observation is...
Jilles van Gurp, Christian Prehofer, Jan Bosch
INFOSCALE
2009
ACM
14 years 19 days ago
CAWA: Continuous Approximate Where-About Queries
With the current proliferation of wireless networks and mobile device technologies, the management of moving object databases to facilitate queries over these domains has been exte...
Alexander J. Aved, Kien A. Hua, Antoniya Petkova