Sciweavers

2004 search results - page 65 / 401
» Sampling from large graphs
Sort
View
SDM
2008
SIAM
256views Data Mining» more  SDM 2008»
15 years 1 months ago
Graph Mining with Variational Dirichlet Process Mixture Models
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda, Kenichi Kurihara
VLDB
2000
ACM
155views Database» more  VLDB 2000»
15 years 3 months ago
ICICLES: Self-Tuning Samples for Approximate Query Answering
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...
Venkatesh Ganti, Mong-Li Lee, Raghu Ramakrishnan
CORR
2008
Springer
91views Education» more  CORR 2008»
14 years 12 months ago
Particle Filtering for Large Dimensional State Spaces with Multimodal Observation Likelihoods
We study efficient importance sampling techniques for particle filtering (PF) when either (a) the observation likelihood (OL) is frequently multimodal or heavy-tailed, or (b) the s...
Namrata Vaswani
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
16 years 3 days ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
VLDB
2002
ACM
161views Database» more  VLDB 2002»
14 years 11 months ago
Distributed Search over the Hidden Web: Hierarchical Database Sampling and Selection
Many valuable text databases on the web have non-crawlable contents that are "hidden" behind search interfaces. Metasearchers are helpful tools for searching over many s...
Panagiotis G. Ipeirotis, Luis Gravano