Sciweavers

8294 search results - page 99 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
SIGMOD
1998
ACM
233views Database» more  SIGMOD 1998»
15 years 9 months ago
Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications
Data mining applications place special requirements on clustering algorithms including: the ability to nd clusters embedded in subspaces of high dimensional data, scalability, end...
Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopul...
156
Voted
SIGMOD
2003
ACM
190views Database» more  SIGMOD 2003»
15 years 10 months ago
Extracting Structured Data from Web Pages
Many web sites contain large sets of pages generated using a common template or layout. For example, Amazon lays out the author, title, comments, etc. in the same way in all its b...
Arvind Arasu, Hector Garcia-Molina
CVPR
2010
IEEE
15 years 7 months ago
Robust Piecewise-Planar 3D Reconstruction and Completion from Large-Scale Unstructured Point Data
In this paper, we present a novel method, the first to date to our knowledge, which is capable of directly and automatically producing a concise and idealized 3D representation f...
Anne-Laure Chauve, Patrick Labatut, Jean-Philippe ...
BMCBI
2010
143views more  BMCBI 2010»
15 years 2 months ago
A genome alignment algorithm based on compression
Background: Traditional genome alignment methods consider sequence alignment as a variation of the string edit distance problem, and perform alignment by matching characters of th...
Minh Duc Cao, Trevor I. Dix, Lloyd Allison
146
Voted
WSC
1997
15 years 6 months ago
Computational Experience with the Batch Means Method
This article discusses implementation issues for the LBATCH and ABATCH batch means procedures of Fishman and Yarberry (1997). Theses procedures dynamically increase the batch size...
Christos Alexopoulos, George S. Fishman, Andrew F....