Sciweavers

3690 search results - page 454 / 738
» Computation with classical sequents
Sort
View
CVPR
2008
IEEE
16 years 1 months ago
A robust descriptor based on Weber's Law
Inspired by Weber's Law, this paper proposes a simple, yet very powerful and robust local descriptor, Weber Local Descriptor (WLD). It is based on the fact that human percept...
Jie Chen, Shiguang Shan, Guoying Zhao, Xilin Chen,...
ECCB
2008
IEEE
16 years 1 months ago
SIRENE: supervised inference of regulatory networks
Living cells are the product of gene expression programs that involve the regulated transcription of thousands of genes. The elucidation of transcriptional regulatory networks in ...
Fantine Mordelet, Jean-Philippe Vert
FOCS
2008
IEEE
16 years 1 months ago
The Power of Reordering for Online Minimum Makespan Scheduling
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...
Matthias Englert, Deniz Özmen, Matthias Weste...
189
Voted
FOCS
2008
IEEE
16 years 1 months ago
Unique Games with Entangled Provers are Easy
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
Julia Kempe, Oded Regev, Ben Toner
ICPR
2008
IEEE
16 years 1 months ago
Point-of-interest detection for range data
Point-of-interest detection is a way of reducing the amount of data that needs to be processed in a certain application and is widely used in 2D image analysis. In 2D image analys...
Fredrik Vikstén, Klas Nordberg, Mikael Kalm...