Sciweavers

2922 search results - page 485 / 585
» Scalable Algorithms for Distribution Search
Sort
View
ICDM
2008
IEEE
235views Data Mining» more  ICDM 2008»
14 years 3 months ago
DECK: Detecting Events from Web Click-Through Data
In the past few years there has been increased research interest in detecting previously unidentified events from Web resources. Our focus in this paper is to detect events from ...
Ling Chen 0002, Yiqun Hu, Wolfgang Nejdl
CIKM
2004
Springer
14 years 2 months ago
Local methods for estimating pagerank values
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
Yen-Yu Chen, Qingqing Gan, Torsten Suel
NLP
2000
14 years 19 days ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
JVCIR
2006
127views more  JVCIR 2006»
13 years 9 months ago
Automatic liver segmentation for volume measurement in CT Images
Computed tomography (CT) images have been widely used for diagnosis of liver disease and volume measurement for liver surgery or transplantation. Automatic liver segmentation and ...
Seong-Jae Lim, Yong-Yeon Jeong, Yo-Sung Ho
COMPGEOM
2006
ACM
14 years 3 months ago
Lower bounds on locality sensitive hashing
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
Rajeev Motwani, Assaf Naor, Rina Panigrahy