Sciweavers

6650 search results - page 688 / 1330
» Mutating database queries
Sort
View
GW
2005
Springer
103views Biometrics» more  GW 2005»
16 years 24 days ago
Re-sampling for Chinese Sign Language Recognition
In Sign Language recognition, one of the problems is to collect enough data. Data collection for both training and testing is a laborious but necessary step. Almost all of the stat...
Chunli Wang, Xilin Chen, Wen Gao
CEC
2010
IEEE
15 years 8 months ago
A modified genetic algorithm for matching building sets with the histograms of forces
Abstract--This paper presents an approach to the task of locating a group of buildings based solely on their relative spatial relationships. This situation can occur in the problem...
Andrew R. Buck, James M. Keller, Marjorie Skubic
ICDAR
2009
IEEE
15 years 5 months ago
Learning Bayesian Networks by Evolution for Classifier Combination
Combining classifier methods have shown their effectiveness in a number of applications. Nonetheless, using simultaneously multiple classifiers may result in some cases in a reduc...
Claudio De Stefano, Francesco Fontanella, Alessand...
PODS
2010
ACM
228views Database» more  PODS 2010»
15 years 9 months ago
Capturing missing tuples and missing values
Databases in real life are often neither entirely closed-world nor entirely open-world. Indeed, databases in an enterprise are typically partially closed, in which a part of the d...
Wenfei Fan, Floris Geerts
288
Voted
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 7 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi