Sciweavers

3637 search results - page 414 / 728
» On Dynamic Bit-Probe Complexity
Sort
View
ICML
2009
IEEE
16 years 7 months ago
Approximate inference for planning in stochastic relational worlds
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...
Tobias Lang, Marc Toussaint
ICML
2006
IEEE
16 years 7 months ago
Efficient inference on sequence segmentation models
Sequence segmentation is a flexible and highly accurate mechanism for modeling several applications. Inference on segmentation models involves dynamic programming computations tha...
Sunita Sarawagi
ISBI
2004
IEEE
16 years 7 months ago
Nonlinear Dimension Reduction of fMRI Data: The Laplacian Embedding Approach
In this paper, we introduce the use of nonlinear dimension reduction for the analysis of functional neuroimaging datasets. Using a Laplacian Embedding approach, we show the power ...
Olivier D. Faugeras, Bertrand Thirion
WWW
2007
ACM
16 years 7 months ago
Adaptive faceted browser for navigation in open information spaces
Open information spaces have several unique characteristics such as their changeability, large size, complexity and diverse user base. These result in novel challenges during user...
Mária Bieliková, Michal Tvarozek
WWW
2006
ACM
16 years 7 months ago
Semantic WS-agreement partner selection
In a dynamic service oriented environment it is desirable for service consumers and providers to offer and obtain guarantees regarding their capabilities and requirements. WS-Agre...
Nicole Oldham, Kunal Verma, Amit P. Sheth, Farshad...