Sciweavers

19 search results - page 4 / 4
» Robust tensor factorization using R1 norm
Sort
View
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 5 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
ECCV
2006
Springer
13 years 8 months ago
A Batch Algorithm for Implicit Non-rigid Shape and Motion Recovery
The recovery of 3D shape and camera motion for non-rigid scenes from single-camera video footage is a very important problem in computer vision. The low-rank shape model consists ...
Adrien Bartoli, Søren I. Olsen
JMLR
2010
159views more  JMLR 2010»
12 years 12 months ago
Inference of Sparse Networks with Unobserved Variables. Application to Gene Regulatory Networks
Networks are becoming a unifying framework for modeling complex systems and network inference problems are frequently encountered in many fields. Here, I develop and apply a gener...
Nikolai Slavov
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
13 years 10 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy