Sciweavers

976 search results - page 101 / 196
» The Complexity of Timetable Construction Problems
Sort
View
ACISP
2004
Springer
14 years 2 months ago
Single Database Private Information Retrieval with Logarithmic Communication
In this paper, we study the problem of single database private information retrieval, and present schemes with only logarithmic server-side communication complexity. Previously th...
Yan-Cheng Chang
BMCBI
2007
115views more  BMCBI 2007»
13 years 9 months ago
Recognizing protein-protein interfaces with empirical potentials and reduced amino acid alphabets
Background: In structural genomics, an important goal is the detection and classification of protein–protein interactions, given the structures of the interacting partners. We h...
Guillaume Launay, Raul Mendez, Shoshana J. Wodak, ...
TCSV
2008
139views more  TCSV 2008»
13 years 9 months ago
A Fast MB Mode Decision Algorithm for MPEG-2 to H.264 P-Frame Transcoding
Abstract--The H.264 standard achieves much higher coding efficiency than the MPEG-2 standard, due to its improved inter-and intra-prediction modes at the expense of higher computat...
Gerardo Fernández-Escribano, Hari Kalva, Pe...
CVPR
2001
IEEE
14 years 11 months ago
Efficient Computation of Adaptive Threshold Surfaces for Image Binarization
The problem of binarization of gray level images acquired under nonuniform illumination is reconsidered. Yanowitz and Bruckstein proposed to use for image binarization an adaptive...
Ilya Blayvas, Alfred M. Bruckstein, Ron Kimmel
GIS
2008
ACM
14 years 10 months ago
Applying hierarchical graphs to pedestrian indoor navigation
In this paper we propose to apply hierarchical graphs to indoor navigation. The intended purpose is to guide humans in large public buildings and assist them in wayfinding. We sta...
Edgar-Philipp Stoffel, Hans Jürgen Ohlbach, K...