Sciweavers

5448 search results - page 309 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
JMLR
2006
118views more  JMLR 2006»
15 years 6 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
ISORC
2008
IEEE
16 years 1 months ago
A Real-Time Java Component Model
The Real-Time Specification for Java (RTSJ) [10] is becoming a popular choice in the world of real-time programming. However, the complexities introduced by RTSJ bring the needs ...
Ales Plsek, Philippe Merle, Lionel Seinturier
ICMCS
2007
IEEE
144views Multimedia» more  ICMCS 2007»
16 years 29 days ago
Splog Detection using Content, Time and Link Structures
This paper focuses on spam blog (splog) detection. Blogs are highly popular, new media social communication mechanisms and splogs corrupt blog search results as well as waste netw...
Yu-Ru Lin, Hari Sundaram, Yun Chi, Jun'ichi Tatemu...
HIPC
2005
Springer
16 years 5 days ago
Application of Reduce Order Modeling to Time Parallelization
We recently proposed a new approach to parallelization, by decomposing the time domain, instead of the conventional space domain. This improves latency tolerance, and we demonstrat...
Ashok Srinivasan, Yanan Yu, Namas Chandra
MM
2004
ACM
107views Multimedia» more  MM 2004»
16 years 2 days ago
Time, voice, and joyce
We present a design for recapitulating walks through Dublin's City Centre by characters in James Joyce's Ulysses. Our computationally supported walkers will avail themse...
Andrea Taylor, Brendan Donovan, Zoltan Foley-Fishe...