Sciweavers

2194 search results - page 161 / 439
» Improving HLRTA*( k )
Sort
View
108
Voted
TCS
2008
15 years 1 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
JOC
2007
93views more  JOC 2007»
15 years 1 months ago
Robust Information-Theoretic Private Information Retrieval
A Private Information Retrieval (PIR) protocol allows a user to retrieve a data item of its choice from a database, such that the servers storing the database do not gain informat...
Amos Beimel, Yoav Stahl
ICETET
2009
IEEE
14 years 11 months ago
Development of HCNG Blended Fuel Engine with Control of NOx Emissions
With increasing concern about energy shortage and environmental protection, research on reducing exhaust emissions, reducing fuel consumption, reducing engine noise and increasing...
K. R. Patil, P. M. Khanwalkar, S. S. Thipse, K. P....
NETWORK
2011
14 years 8 months ago
Inferring video QoE in real time
Inferring the subjective perception of a video stream in real time continues to be a stiff problem. This article presents MintMOS: a lightweight, no-reference, loadable kernel mod...
Mukundan Venkataraman, Mainak Chatterjee
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
13 years 4 months ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...