Sciweavers

2827 search results - page 203 / 566
» Robustness of PSPACE-complete sets
Sort
View
DKE
2002
107views more  DKE 2002»
15 years 3 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
126
Voted
IJCV
2000
132views more  IJCV 2000»
15 years 3 months ago
2 1/2 D Visual Servoing with Respect to Unknown Objects Through a New Estimation Scheme of Camera Displacement
Classical visual servoing techniques need a strong a priori knowledge of the shape and the dimensions of the observed objects. In this paper, we present how the 2 1/2 D visual serv...
Ezio Malis, François Chaumette
IJCV
2000
225views more  IJCV 2000»
15 years 3 months ago
Depth from Defocus vs. Stereo: How Different Really Are They?
Depth from Focus (DFF) and Depth from Defocus (DFD) methods are theoretically unified with the geometric triangulation principle. Fundamentally, the depth sensitivities of DFF and ...
Yoav Y. Schechner, Nahum Kiryati
124
Voted
JAR
2000
123views more  JAR 2000»
15 years 3 months ago
Local Search Algorithms for SAT: An Empirical Evaluation
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
Holger H. Hoos, Thomas Stützle
JHSN
2000
172views more  JHSN 2000»
15 years 3 months ago
Dynamic token bucket (DTB): a fair bandwidth allocation algorithm for high-speed networks
Fair allocation of available bandwidth to competing flows is a simple form of quality of service (QoS) that can be provided to customers in packet-switched networks. A number of p...
Jayakrishna Kidambi, Dipak Ghosal, Biswanath Mukhe...