Sciweavers

21 search results - page 4 / 5
» Tie-breaking strategies for fast distance join processing
Sort
View
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 7 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
SI3D
2006
ACM
13 years 10 months ago
Multi-scale line drawings from 3D meshes
We present an effective method for automatically selecting the appropriate scale of shape features that are depicted when rendering a 3D mesh in the style of a line drawing. The m...
Alex Ni, Kyuman Jeong, Seungyong Lee, Lee Markosia...
ADC
2007
Springer
183views Database» more  ADC 2007»
13 years 8 months ago
Efficient Similarity Search by Summarization in Large Video Database
With the explosion of video data, video processing technologies have advanced quickly and been applied into many fields, such as advertisements, medical etc.. To fast search these...
Xiangmin Zhou, Xiaofang Zhou, Heng Tao Shen
AIPS
2008
13 years 7 months ago
Useless Actions Are Useful
Planning as heuristic search is a powerful approach to solving domain independent planning problems. In recent years, various successful heuristics and planners like FF, LPG, FAST...
Martin Wehrle, Sebastian Kupferschmid, Andreas Pod...
SIGMOD
2010
ACM
323views Database» more  SIGMOD 2010»
13 years 9 months ago
Boosting spatial pruning: on optimal pruning of MBRs
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...