Sciweavers

6740 search results - page 210 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 11 months ago
Hitting forbidden minors: Approximation and Kernelization
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra...
DEDS
2008
87views more  DEDS 2008»
13 years 10 months ago
On-Line Monitoring of Large Petri Net Models Under Partial Observation
This paper deals with the on-line monitoring of large systems modeled as Petri Nets under partial observation. The plant observation is given by a subset of transitions whose occu...
George Jiroveanu, René K. Boel, Behzad Bord...
BMCBI
2006
145views more  BMCBI 2006»
13 years 10 months ago
Querying the public databases for sequences using complex keywords contained in the feature lines
Background: High throughput technologies often require the retrieval of large data sets of sequences. Retrieval of EMBL or GenBank entries using keywords is easy using tools such ...
Olivier Croce, Michaël Lamarre, Richard Chris...
BMCBI
2006
124views more  BMCBI 2006»
13 years 10 months ago
The development and validation of the Virtual Tissue Matrix, a software application that facilitates the review of tissue microa
Background: The Tissue Microarray (TMA) facilitates high-throughput analysis of hundreds of tissue specimens simultaneously. However, bottlenecks in the storage and manipulation o...
Catherine M. Conway, Deirdre O'Shea, Sallyann O'Br...
VLSISP
2008
95views more  VLSISP 2008»
13 years 10 months ago
Design of an H.264/AVC Decoder with Memory Hierarchy and Line-Pixel-Lookahead
This paper describes a novel memory hierarchy and line-pixel-lookahead (LPL) for an H.264/AVC video decoder. The memory system is the bottleneck of most video processors, particula...
Tsu-Ming Liu, Chen-Yi Lee