Sciweavers

2107 search results - page 356 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
AAAI
2008
13 years 11 months ago
Feature Selection for Activity Recognition in Multi-Robot Domains
In multi-robot settings, activity recognition allows a robot to respond intelligently to the other robots in its environment. Conditional random fields are temporal models that ar...
Douglas L. Vail, Manuela M. Veloso
SMA
2010
ACM
177views Solid Modeling» more  SMA 2010»
13 years 9 months ago
Multi-level grid algorithms for faster molecular energetics
Bio-molecules reach their stable configuration in solvent which is primarily water with a small concentration of salt ions. One approximation of the total free energy of a bio-mol...
Rezaul Alam Chowdhury, Chandrajit L. Bajaj
CSDA
2008
94views more  CSDA 2008»
13 years 9 months ago
Robust model selection using fast and robust bootstrap
Robust model selection procedures control the undue influence that outliers can have on the selection criteria by using both robust point estimators and a bounded loss function wh...
Matias Salibian-Barrera, Stefan Van Aelst
QUESTA
2007
98views more  QUESTA 2007»
13 years 8 months ago
The acquisition queue
We propose a new queueing model named the acquisition queue. It differs from conventional queueing models in that the server not only serves customers, but also performs acquisit...
Dee Denteneer, J. S. H. van Leeuwaarden, Ivo J. B....
PKDD
2010
Springer
158views Data Mining» more  PKDD 2010»
13 years 7 months ago
Learning Sparse Gaussian Markov Networks Using a Greedy Coordinate Ascent Approach
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
Katya Scheinberg, Irina Rish