Sciweavers

6274 search results - page 309 / 1255
» From query complexity to computational complexity
Sort
View
INFOVIS
2003
IEEE
15 years 11 months ago
Improving Hybrid MDS with Pivot-Based Searching
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...
Alistair Morrison, Matthew Chalmers
ECCV
2002
Springer
16 years 8 months ago
Bayesian Estimation of Layers from Multiple Images
When estimating foreground and background layers (or equivalently an alpha matte), it is often the case that pixel measurements contain mixed colours which are a combination of for...
Yonatan Wexler, Andrew W. Fitzgibbon, Andrew Zisse...
CVPR
2012
IEEE
13 years 8 months ago
Large scale metric learning from equivalence constraints
In this paper, we raise important issues on scalability and the required degree of supervision of existing Mahalanobis metric learning methods. Often rather tedious optimization p...
Martin Köstinger, Martin Hirzer, Paul Wohlhar...
XSYM
2004
Springer
115views Database» more  XSYM 2004»
15 years 11 months ago
XQuery Processing with Relevance Ranking
Abstract. We are presenting a coherent framework for XQuery processing that incorporates IR-style approximate matching and allows the ordering of results by their relevance score. ...
Leonidas Fegaras
HPDC
2005
IEEE
15 years 12 months ago
Dynamic load balancing for distributed search
This paper examines how computation can be mapped across the nodes of a distributed search system to effectively utilize available resources. We specifically address computationa...
Larry Huston, Alex Nizhner, Padmanabhan Pillai, Ra...