Sciweavers

7228 search results - page 252 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
KDD
2006
ACM
160views Data Mining» more  KDD 2006»
16 years 4 months ago
Coherent closed quasi-clique discovery from large dense graph databases
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
Zhiping Zeng, Jianyong Wang, Lizhu Zhou, George Ka...
DOLAP
2006
ACM
15 years 10 months ago
Enhanced mining of association rules from data cubes
On-line analytical processing (OLAP) provides tools to explore and navigate into data cubes in order to extract interesting information. Nevertheless, OLAP is not capable of expla...
Riadh Ben Messaoud, Sabine Loudcher Rabaséd...
EMMCVPR
2005
Springer
15 years 10 months ago
Learning Hierarchical Shape Models from Examples
Abstract. We present an algorithm for automatically constructing a decompositional shape model from examples. Unlike current approaches to structural model acquisition, in which on...
Alex Levinshtein, Cristian Sminchisescu, Sven J. D...
FPGA
2008
ACM
623views FPGA» more  FPGA 2008»
15 years 6 months ago
From the bitstream to the netlist
We present an in-depth analysis of the Xilinx bitstream format. The information gathered in this paper allows bitstream compilation and decompilation. While not actually compromis...
Jean-Baptiste Note, Éric Rannaud
DOCENG
2010
ACM
15 years 5 months ago
Glyph extraction from historic document images
This paper is about the reproduction of ancient texts with vectorised fonts. While for OCR only recognition rates count, a reproduction process does not necessarily require the re...
Lothar Meyer-Lerbs, Arne Schuldt, Björn Gottf...