Sciweavers

6740 search results - page 983 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
CIKM
2008
Springer
15 years 8 months ago
Exploiting context to detect sensitive information in call center conversations
Protecting sensitive information while preserving the shareability and usability of data is becoming increasingly important. In call-centers a lot of customer related sensitive in...
Tanveer A. Faruquie, Sumit Negi, Anup Chalamalla, ...
COCOON
2008
Springer
15 years 8 months ago
The Computational Complexity of Link Building
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
Martin Olsen
AAAI
2010
15 years 8 months ago
g-Planner: Real-time Motion Planning and Global Navigation using GPUs
We present novel randomized algorithms for solving global motion planning problems that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data...
Jia Pan, Christian Lauterbach, Dinesh Manocha
177
Voted
EMNLP
2008
15 years 8 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney
IMECS
2007
15 years 8 months ago
Using Similarity Flooding for Extracting Similar Parts of Proteins
—Proteins are the main players in the game of life. Good understanding of their structures, functions, and behaviors leads to good understanding of drugs, diseases, and thus our ...
Hassan Sayyadi, Sara Salehi, Mohammad Ghodsi