Sciweavers

436 search results - page 48 / 88
» Recursion and Complexity
Sort
View
SAS
2001
Springer
14 years 1 months ago
Solving Regular Tree Grammar Based Constraints
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
Yanhong A. Liu, Ning Li, Scott D. Stoller
TMC
2011
137views more  TMC 2011»
13 years 4 months ago
Cognitive Medium Access: Exploration, Exploitation, and Competition
— This paper establishes the equivalence between cognitive medium access and the competitive multi-armed bandit problem. First, the scenario in which a single cognitive user wish...
Lifeng Lai, Hesham El Gamal, Hai Jiang, H. Vincent...
IPPS
2002
IEEE
14 years 2 months ago
Achieving Scalability in Parallel Tabled Logic Programs
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming becau...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
CORR
2012
Springer
222views Education» more  CORR 2012»
12 years 4 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
ICCV
2001
IEEE
14 years 11 months ago
Propagation of Innovative Information in Non-Linear Least-Squares Structure from Motion
We present a new technique that improves upon existing structure from motion (SFM) methods. We propose a SFM algorithm that is both recursive and optimal. Our method incorporates ...
Drew Steedly, Irfan A. Essa