Sciweavers

625 search results - page 114 / 125
» On one algorithm for solving the problem of source function ...
Sort
View
IJCAI
2007
13 years 9 months ago
All Common Subsequences
Time series data abounds in real world problems. Measuring the similarity of time series is a key to solving these problems. One state of the art measure is the longest common sub...
Hui Wang
NETWORKING
2004
13 years 9 months ago
Multi-objective Egress Router Selection Policies for Inter-domain Traffic with Bandwidth Guarantees
The next generation Internet is designed to accommodate flows that span across multiple domains with quality of service guarantees, in particular bandwidth. In this context, destin...
Kin-Hon Ho, Ning Wang, Panos Trimintzios, George P...
ICCAD
2000
IEEE
102views Hardware» more  ICCAD 2000»
14 years 4 days ago
Provably Good Global Buffering Using an Available Buffer Block Plan
To implement high-performance global interconnect without impacting the performance of existing blocks, the use of buffer blocks is increasingly popular in structured-custom and b...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
ECEASST
2006
305views more  ECEASST 2006»
13 years 7 months ago
The ParMol Package for Frequent Subgraph Mining
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
Thorsten Meinl, Marc Wörlein, Olga Urzova, In...
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
14 years 1 months ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma