Sciweavers

4926 search results - page 409 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
JCB
2002
70views more  JCB 2002»
15 years 4 months ago
Strong Feature Sets from Small Samples
For small samples, classi er design algorithms typically suffer from over tting. Given a set of features, a classi er must be designed and its error estimated. For small samples, ...
Seungchan Kim, Edward R. Dougherty, Junior Barrera...
SIGMOD
1999
ACM
143views Database» more  SIGMOD 1999»
15 years 8 months ago
WALRUS: A Similarity Retrieval Algorithm for Image Databases
Traditional approaches for content-based image querying typically compute a single signature for each image based on color histograms, texture, wavelet transforms etc., and return...
Apostol Natsev, Rajeev Rastogi, Kyuseok Shim
DOCENG
2007
ACM
15 years 8 months ago
A document object modeling method to retrieve data from a very large XML document
Document Object Modeling (DOM) is widely used approach for retrieving data from an XML document. If the size of the XML document is very large, however, using the DOM approach for...
Seung Min Kim, Suk I. Yoo, Eunji Hong, Tae Gwon Ki...
CCE
2007
15 years 4 months ago
Adaptive optimisation of noisy black-box functions inherent in microscopic models
For systems where exact constitutive relations are unknown, a microscopic level description can be alternatively used. As microscopic simulations are computationally expensive, th...
Eddie Davis, Marianthi G. Ierapetritou
CVIU
2011
14 years 8 months ago
Polynomial algorithms for subisomorphism of nD open combinatorial maps
Combinatorial maps describe the subdivision of objects in cells, and incidence and adjacency relations between cells, and they are widely used to model 2D and 3D images. However, ...
Guillaume Damiand, Christine Solnon, Colin de la H...