Sciweavers

316 search results - page 18 / 64
» On Approximate Majority and Probabilistic Time
Sort
View
ICML
2004
IEEE
15 years 10 months ago
Dynamic conditional random fields: factorized probabilistic models for labeling and segmenting sequence data
In sequence modeling, we often wish to represent complex interaction between labels, such as when performing multiple, cascaded labeling tasks on the same sequence, or when longra...
Charles A. Sutton, Khashayar Rohanimanesh, Andrew ...
KDD
2009
ACM
298views Data Mining» more  KDD 2009»
15 years 4 months ago
Mind the gaps: weighting the unknown in large-scale one-class collaborative filtering
One-Class Collaborative Filtering (OCCF) is a task that naturally emerges in recommender system settings. Typical characteristics include: Only positive examples can be observed, ...
Rong Pan, Martin Scholz
RSS
2007
159views Robotics» more  RSS 2007»
14 years 11 months ago
Gaussian Beam Processes: A Nonparametric Bayesian Measurement Model for Range Finders
— In probabilistic mobile robotics, the development of measurement models plays a crucial role as it directly influences the efficiency and the robustness of the robot’s perf...
Christian Plagemann, Kristian Kersting, Patrick Pf...
EMSOFT
2004
Springer
15 years 3 months ago
Practical PACE for embedded systems
In current embedded systems, one of the major concerns is energy conservation. The dynamic voltage-scheduling (DVS) framework, which involves dynamically adjusting the voltage and...
Ruibin Xu, Chenhai Xi, Rami G. Melhem, Daniel Moss...
HPDC
2006
IEEE
15 years 3 months ago
Path Grammar Guided Trace Compression and Trace Approximation
Trace-driven simulation is an important technique used in the evaluation of computer architecture innovations. However using it for studying parallel computers and applications is...
Xiaofeng Gao, Allan Snavely, Larry Carter