Sciweavers

3894 search results - page 727 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
DAGM
2009
Springer
15 years 6 months ago
Markerless 3D Face Tracking
We present a novel algorithm for the markerless tracking of deforming surfaces such as faces. We acquire a sequence of 3D scans along with color images at 40Hz. The data is then re...
Christian Walder, Martin Breidt, Heinrich H. B&uum...
ICDM
2008
IEEE
108views Data Mining» more  ICDM 2008»
15 years 6 months ago
Non-negative Matrix Factorization on Manifold
Recently Non-negative Matrix Factorization (NMF) has received a lot of attentions in information retrieval, computer vision and pattern recognition. NMF aims to find two non-nega...
Deng Cai, Xiaofei He, Xiaoyun Wu, Jiawei Han
FOCS
2007
IEEE
15 years 6 months ago
Mechanism Design via Differential Privacy
We study the role that privacy-preserving algorithms, which prevent the leakage of specific information about participants, can play in the design of mechanisms for strategic age...
Frank McSherry, Kunal Talwar
ISBI
2007
IEEE
15 years 6 months ago
Tracing Microtubules in Live Cell Images
Microtubule (MT) dynamics are traditionally analyzed from time lapse images by manual techniques that are laborious, approximate and often limited. Recently, computer vision techn...
Mehmet Emre Sargin, Alphan Altinok, Erlam Kiris, S...
COCOON
2007
Springer
15 years 6 months ago
Can a Graph Have Distinct Regular Partitions?
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
Noga Alon, Asaf Shapira, Uri Stav