Sciweavers

536 search results - page 33 / 108
» Efficient Search Using Bitboard Models
Sort
View
ICDE
2008
IEEE
130views Database» more  ICDE 2008»
14 years 9 months ago
Efficient Computation of Diverse Query Results
We study the problem of efficiently computing diverse query results in online shopping applications, where users specify queries through a form interface that allows a mix of stru...
Erik Vee, Utkarsh Srivastava, Jayavel Shanmugasund...
ECCV
2002
Springer
14 years 9 months ago
Implicit Probabilistic Models of Human Motion for Synthesis and Tracking
Abstract. This paper addresses the problem of probabilistically modeling 3D human motion for synthesis and tracking. Given the high dimensional nature of human motion, learning an ...
Hedvig Sidenbladh, Michael J. Black, Leonid Sigal
BMCBI
2010
178views more  BMCBI 2010»
13 years 7 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
JODL
2006
136views more  JODL 2006»
13 years 7 months ago
An experimental effectiveness comparison of methods for 3D similarity search
Methods for content-based similarity search are fundamental for managing large multimedia repositories, as they make it possible to conduct queries for similar content, and to orga...
Benjamin Bustos, Daniel A. Keim, Dietmar Saupe, To...
CONSTRAINTS
2007
112views more  CONSTRAINTS 2007»
13 years 7 months ago
Maxx: Test Pattern Optimisation with Local Search Over an Extended Logic
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
Francisco Azevedo