Sciweavers

536 search results - page 86 / 108
» The hardness and approximation algorithms for l-diversity
Sort
View
CVPR
2005
IEEE
14 years 10 months ago
Pose-Robust Face Recognition Using Geometry Assisted Probabilistic Modeling
Researchers have been working on human face recognition for decades. Face recognition is hard due to different types of variations in face images, such as pose, illumination and e...
Xiaoming Liu 0002, Tsuhan Chen
ICCV
2005
IEEE
14 years 10 months ago
Globally Optimal Solutions for Energy Minimization in Stereo Vision Using Reweighted Belief Propagation
A wide range of low level vision problems have been formulated in terms of finding the most probable assignment of a Markov Random Field (or equivalently the lowest energy configu...
Talya Meltzer, Chen Yanover, Yair Weiss
EDBT
2004
ACM
155views Database» more  EDBT 2004»
14 years 8 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
WABI
2007
Springer
109views Bioinformatics» more  WABI 2007»
14 years 2 months ago
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence
In this paper we introduce a new method of combined synthesis and inference of biological signal transduction networks. A main idea of our method lies in representing observed cau...
Réka Albert, Bhaskar DasGupta, Riccardo Don...
WIDM
2006
ACM
14 years 2 months ago
Identifying redundant search engines in a very large scale metasearch engine context
For a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method t...
Ronak Desai, Qi Yang, Zonghuan Wu, Weiyi Meng, Cle...