Sciweavers

108 search results - page 16 / 22
» Maximal Intersection Queries in Randomized Graph Models
Sort
View
PVLDB
2008
122views more  PVLDB 2008»
13 years 7 months ago
Exploiting shared correlations in probabilistic databases
There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources -from sensor data, experimental data, data fro...
Prithviraj Sen, Amol Deshpande, Lise Getoor
SPAA
2006
ACM
14 years 1 months ago
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
R. C. Chakinala, Abishek Kumarasubramanian, Kofi A...
MIDDLEWARE
2004
Springer
14 years 1 months ago
A Content Model for Evaluating Peer-to-Peer Searching Techniques
Simulation studies are frequently used to evaluate new peer-to-peer searching techniques as well as existing techniques on new applications. Unless these studies are accurate in th...
Brian F. Cooper
GLOBECOM
2006
IEEE
14 years 1 months ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang
ICCV
2007
IEEE
14 years 9 months ago
Objects in Context
In the task of visual object categorization, semantic context can play the very important role of reducing ambiguity in objects' visual appearance. In this work we propose to...
Andrew Rabinovich, Andrea Vedaldi, Carolina Galleg...