Sciweavers

586 search results - page 21 / 118
» Ranking queries on uncertain data
Sort
View
AAAI
2008
13 years 10 months ago
Efficient Querying Relaxed Dominant Relationship between Product Items Based on Rank Aggregation
Current search engines cannot effectively rank those relational data, which exists on dynamic websites supported by online databases. In this study, to rank such structured data, ...
Zhenglu Yang, Lin Li, Masaru Kitsuregawa
SPIRE
2005
Springer
14 years 1 months ago
Rank-Sensitive Data Structures
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
Iwona Bialynicka-Birula, Roberto Grossi
TKDE
2008
146views more  TKDE 2008»
13 years 7 months ago
Toward Managing Uncertain Spatial Information for Situational Awareness Applications
Situational awareness (SA) applications monitor the real world and the entities therein to support tasks such as rapid decision making, reasoning, and analysis. Raw input about unf...
Yiming Ma, Dmitri V. Kalashnikov, Sharad Mehrotra
GI
2010
Springer
13 years 6 months ago
Ranked Set Search in Medline Documents
: Information needs like searching scientific literature that involve high recall rates are difficult to satisfy with ad hoc keyword search. We propose to state queries implicitl...
Kristin Mittag, Alexander Hinneburg
EDBT
2012
ACM
216views Database» more  EDBT 2012»
11 years 10 months ago
Effectively indexing the multi-dimensional uncertain objects for range searching
The range searching problem is fundamental in a wide spectrum of applications such as radio frequency identification (RFID) networks, location based services (LBS), and global po...
Ying Zhang, Wenjie Zhang, Qianlu Lin, Xuemin Lin