Sciweavers

1012 search results - page 185 / 203
» Testing documentation with
Sort
View
WWW
2011
ACM
14 years 4 months ago
Web scale NLP: a case study on url word breaking
This paper uses the URL word breaking task as an example to elaborate what we identify as crucialin designingstatistical natural language processing (NLP) algorithmsfor Web scale ...
Kuansan Wang, Christopher Thrasher, Bo-June Paul H...
WSDM
2012
ACM
267views Data Mining» more  WSDM 2012»
13 years 5 months ago
Learning to rank with multi-aspect relevance for vertical search
Many vertical search tasks such as local search focus on specific domains. The meaning of relevance in these verticals is domain-specific and usually consists of multiple well-d...
Changsung Kang, Xuanhui Wang, Yi Chang, Belle L. T...
SIGIR
2012
ACM
13 years 1 days ago
Content-based retrieval for heterogeneous domains: domain adaptation by relative aggregation points
We introduce the problem of domain adaptation for content-based retrieval and propose a domain adaptation method based on relative aggregation points (RAPs). Content-based retriev...
Makoto P. Kato, Hiroaki Ohshima, Katsumi Tanaka
ATAL
2009
Springer
15 years 4 months ago
Caching schemes for DCOP search algorithms
Distributed Constraint Optimization (DCOP) is useful for solving agent-coordination problems. Any-space DCOP search algorithms require only a small amount of memory but can be spe...
William Yeoh, Pradeep Varakantham, Sven Koenig
TOG
1998
98views more  TOG 1998»
14 years 9 months ago
V-Clip: Fast and Robust Polyhedral Collision Detection
This paper presents the Voronoi-clip, or V-clip, collision detection algorithm for polyhedral objects specified by a boundary representation. V-clip tracks the closest pair of fe...
Brian Mirtich