Sciweavers

2269 search results - page 429 / 454
» Query Incentive Networks
Sort
View
AAAI
2011
12 years 10 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
EDBT
2012
ACM
216views Database» more  EDBT 2012»
12 years 23 days 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
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
14 years 10 months ago
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
Dimitris Achlioptas, Aaron Clauset, David Kempe, C...
PODS
2003
ACM
132views Database» more  PODS 2003»
14 years 10 months ago
The view selection problem for XML content based routing
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
Ashish Kumar Gupta, Dan Suciu, Alon Y. Halevy
AINA
2008
IEEE
14 years 4 months ago
Dynamic Cache Invalidation Scheme in IR-Based Wireless Environments
Traditional cache invalidation schemes are not suitable to be employed in wireless environments due to the affections of mobility, energy consumption, and limited bandwidth. Cache ...
Yeim-Kuan Chang, Yi-Wei Ting, Tai-Hong Lin