Sciweavers

1200 search results - page 42 / 240
» Marked Ancestor Problems
Sort
View
ACID
2006
236views Algorithms» more  ACID 2006»
13 years 11 months ago
Kernelization for Convex Recoloring
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
Hans L. Bodlaender, Michael R. Fellows, Michael A....
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 4 months ago
Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
Mark Sh. Levin

Publication
167views
13 years 10 months ago
A Network Coding Approach to IP Traceback
Traceback schemes aim at identifying the source(s) of a sequence of packets and the nodes these packets traversed. This is useful for tracing the sources of high volume traffic, e...
Pegah Sattari, Minas Gjoka, Athina Markopoulou
CORR
2012
Springer
292views Education» more  CORR 2012»
12 years 5 months ago
Optimal Threshold Control by the Robots of Web Search Engines with Obsolescence of Documents
A typical web search engine consists of three principal parts: crawling engine, indexing engine, and searching engine. The present work aims to optimize the performance of the cra...
Konstantin Avrachenkov, Alexander N. Dudin, Valent...
MLCW
2005
Springer
14 years 3 months ago
An Inference Model for Semantic Entailment in Natural Language
Semantic entailment is the problem of determining if the meaning of a given sentence entails that of another. This is a fundamental problem in natural language understanding that ...
Rodrigo de Salvo Braz, Roxana Girju, Vasin Punyaka...