Sciweavers

3922 search results - page 323 / 785
» Working Models for Uncertain Data
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 12 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
CIKM
2009
Springer
16 years 1 months ago
Exploring relevance for clicks
Mining feedback information from user click-through data is an important issue for modern Web retrieval systems in terms of architecture analysis, performance evaluation and algor...
Rongwei Cen, Yiqun Liu, Min Zhang, Bo Zhou, Liyun ...
SAC
2005
ACM
16 years 9 days ago
Identifying topological predicates for vague spatial objects
Many geographical applications deal with spatial objects that cannot be adequately described by determinate, crisp concepts because of their intrinsically indeterminate and vague ...
Alejandro Pauly, Markus Schneider
JASIS
2008
76views more  JASIS 2008»
15 years 6 months ago
Using importance flooding to identify interesting networks of criminal activity
Abstract. In spite of policy concerns and high costs, the law enforcement community is investing heavily in data sharing initiatives. Cross-jurisdictional criminal justice informat...
Byron Marshall, Hsinchun Chen, Siddharth Kaza
INFOCOM
2009
IEEE
16 years 1 months ago
Tuning Skype's Redundancy Control Algorithm for User Satisfaction
—Determining how to transport delay-sensitive voice data has long been a problem in multimedia networking. The difficulty arises because voice and best-effort data are different...
Te-Yuan Huang, Kuan-Ta Chen, Polly Huang