Sciweavers

3381 search results - page 579 / 677
» Extending Dependencies with Conditions
Sort
View
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
16 years 7 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
CHI
2007
ACM
16 years 7 months ago
Studying activity patterns in CSCW
We study small distributed work groups capturing, managing, and reusing knowledge in a collaborative activity. We conceive this process as adaptation of a group to an activity and...
Gregorio Convertino, Thomas P. Moran, Barton A. Sm...
160
Voted
CHI
2001
ACM
16 years 7 months ago
Ignoring perfect knowledge in-the-world for imperfect knowledge in-the-head
Constraints and dependencies among the elements of embodied cognition form patterns or microstrategies of interactive behavior. Hard constraints determine which microstrategies ar...
Wayne D. Gray, Wai-Tat Fu
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
16 years 7 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson
ICALP
2009
Springer
16 years 7 months ago
Tight Bounds for the Cover Time of Multiple Random Walks
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
Robert Elsässer, Thomas Sauerwald