Sciweavers

6693 search results - page 1022 / 1339
» Methods of Automatic Algorithm Generation
Sort
View
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 5 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
CGF
2008
182views more  CGF 2008»
15 years 3 months ago
Lazy Solid Texture Synthesis
Existing solid texture synthesis algorithms generate a full volume of color content from a set of 2D example images. We introduce a new algorithm with the unique ability to restri...
Yue Dong, Sylvain Lefebvre, Xin Tong, George Drett...
ICDM
2008
IEEE
137views Data Mining» more  ICDM 2008»
15 years 10 months ago
Stream Sequential Pattern Mining with Precise Error Bounds
Sequential pattern mining is an interesting data mining problem with many real-world applications. This problem has been studied extensively in static databases. However, in recen...
Luiz F. Mendes, Bolin Ding, Jiawei Han
KDD
2002
ACM
170views Data Mining» more  KDD 2002»
16 years 4 months ago
Web site mining: a new way to spot competitors, customers and suppliers in the world wide web
When automatically extracting information from the world wide web, most established methods focus on spotting single HTMLdocuments. However, the problem of spotting complete web s...
Martin Ester, Hans-Peter Kriegel, Matthias Schuber...
CIKM
2008
Springer
15 years 5 months ago
Modeling LSH for performance tuning
Although Locality-Sensitive Hashing (LSH) is a promising approach to similarity search in high-dimensional spaces, it has not been considered practical partly because its search q...
Wei Dong, Zhe Wang, William Josephson, Moses Chari...
« Prev « First page 1022 / 1339 Last » Next »