Sciweavers

42230 search results - page 142 / 8446
» Algorithms and Complexity Results for
Sort
View
CORR
2006
Springer
91views Education» more  CORR 2006»
14 years 10 months ago
Improved results for a memory allocation problem
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...
Leah Epstein, Rob van Stee
IPL
2006
97views more  IPL 2006»
14 years 10 months ago
A fixed-parameter tractability result for multicommodity demand flow in trees
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
Jiong Guo, Rolf Niedermeier
SIGIR
2010
ACM
15 years 1 months ago
Entity information management in complex networks
Entity information management (EIM) is a nascent IR research area that investigates the information management process about entities instead of documents. It is motivated by the ...
Yi Fang
ICCAD
2003
IEEE
161views Hardware» more  ICCAD 2003»
15 years 6 months ago
A General S-Domain Hierarchical Network Reduction Algorithm
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
Sheldon X.-D. Tan
BMCBI
2006
153views more  BMCBI 2006»
14 years 10 months ago
The 3of5 web application for complex and comprehensive pattern matching in protein sequences
Background: The identification of patterns in biological sequences is a key challenge in genome analysis and in proteomics. Frequently such patterns are complex and highly variabl...
Markus Seiler, Alexander Mehrle, Annemarie Poustka...