Sciweavers

3677 search results - page 707 / 736
» Is a probabilistic modeling
Sort
View
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 8 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
WWW
2009
ACM
14 years 8 months ago
Quicklink selection for navigational query results
Quicklinks for a website are navigational shortcuts displayed below the website homepage on a search results page, and that let the users directly jump to selected points inside t...
Deepayan Chakrabarti, Ravi Kumar, Kunal Punera
WWW
2003
ACM
14 years 8 months ago
Monitoring the dynamic web to respond to continuous queries
Continuous queries are queries for which responses given to users must be continuously updated, as the sources of interest get updated. Such queries occur, for instance, during on...
Sandeep Pandey, Krithi Ramamritham, Soumen Chakrab...
MOBISYS
2009
ACM
14 years 8 months ago
Longitudinal study of a building-scale RFID ecosystem
Radio Frequency IDentification (RFID) deployments are becoming increasingly popular in both industrial and consumer-oriented settings. To effectively exploit and operate such depl...
Evan Welbourne, Karl Koscher, Emad Soroush, Magdal...
MOBIHOC
2005
ACM
14 years 7 months ago
On the node-scheduling approach to topology control in ad hoc networks
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
Budhaditya Deb, Badri Nath