Sciweavers

1887 search results - page 11 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
14 years 7 months ago
Efficient Keyword Search for Smallest LCAs in XML Databases
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe cor...
Yu Xu, Yannis Papakonstantinou
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
14 years 8 months ago
Efficient ticket routing by resolution sequence mining
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...
COMPGEOM
2001
ACM
13 years 11 months ago
Segment intersection searching problems in general settings
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Vladlen Koltun
ISMIR
2005
Springer
157views Music» more  ISMIR 2005»
14 years 1 months ago
A Partial Searching Algorithm and Its Application for Polyphonic Music Transcription
This paper proposes an algorithm for studying spectral contents of pitched sounds in real-world recordings. We assume that the 2nd -order difference, w.r.t. partial index, of a pi...
Wen Xue, M. Sandler
SIGMOD
2006
ACM
162views Database» more  SIGMOD 2006»
14 years 7 months ago
Efficient query processing in geographic web search engines
Geographic web search engines allow users to constrain and order search results in an intuitive manner by focusing a query on a particular geographic region. Geographic search tec...
Yen-Yu Chen, Torsten Suel, Alexander Markowetz