Sciweavers

    IPL
    2006
    79views more  IPL 2006»
    Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy
    14 years 17 days ago
    Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy
    Download  ants.iis.sinica.edu.tw
    This paper addresses the problem of bandwidth allocation under the weighted maximum rate constrained link sharing policy and proves a key theory in the condition of allocation ter...
    Jeng Farn Lee, Meng Chang Chen, Ming-Tat Ko, Wanji...
    claim paper
    Read More »
    IPL
    2006
    80views more  IPL 2006»
    BubbleSearch: A simple heuristic for improving priority-based greedy algorithms
    14 years 17 days ago
    BubbleSearch: A simple heuristic for improving priority-based greedy algorithms
    Download  www.eecs.harvard.edu
    We introduce BubbleSearch, a general approach for extending priority-based greedy heuristics. Following the framework recently developed by Borodin et al., we consider priority al...
    Neal Lesh, Michael Mitzenmacher
    claim paper
    Read More »
    IPL
    2006
    89views more  IPL 2006»
    Optimal 2-constraint satisfaction via sum-product algorithms
    14 years 17 days ago
    Optimal 2-constraint satisfaction via sum-product algorithms
    Download  www.cs.helsinki.fi
    We show that for a given set of m pairwise constraints over n variables, a variable assignment that satisfies maximally many m constraints (MAX-2-CSP) can be found in O(nm dn/3) t...
    Mikko Koivisto
    claim paper
    Read More »
    IPL
    2006
    86views more  IPL 2006»
    On the relationship between squared pairings and plain pairings
    14 years 17 days ago
    On the relationship between squared pairings and plain pairings
    Download  eprint.iacr.org
    In this paper, we investigate the relationship between the squared Weil/Tate pairing and the plain Weil/Tate pairing. Along these lines, we first show that the squared pairing for ...
    Bo Gyeong Kang, Je Hong Park
    claim paper
    Read More »
    IPL
    2006
    87views more  IPL 2006»
    Strongly secure ramp secret sharing schemes for general access structures
    14 years 17 days ago
    Strongly secure ramp secret sharing schemes for general access structures
    Download  hirosuke.it.k.u-tokyo.ac.jp
    Ramp secret sharing (SS) schemes can be classified into strong ramp SS schemes and weak ramp SS schemes. The strong ramp SS schemes do not leak out any part of a secret explicitly...
    Mitsugu Iwamoto, Hirosuke Yamamoto
    claim paper
    Read More »
    IPL
    2006
    93views more  IPL 2006»
    Applying adaptive test cases to nondeterministic implementations
    14 years 17 days ago
    Applying adaptive test cases to nondeterministic implementations
    Download  bura.brunel.ac.uk
    Robert M. Hierons
    claim paper
    Read More »
    IPL
    2006
    104views more  IPL 2006»
    Optimal register allocation for SSA-form programs in polynomial time
    14 years 17 days ago
    Optimal register allocation for SSA-form programs in polynomial time
    Download  www.cs.ucla.edu
    This paper gives a constructive proof that the register allocation problem for a uniform register set is solvable in polynomial time for SSA-form programs. 2006 Elsevier B.V. All ...
    Sebastian Hack, Gerhard Goos
    claim paper
    Read More »
    IPL
    2006
    97views more  IPL 2006»
    A fixed-parameter tractability result for multicommodity demand flow in trees
    14 years 17 days ago
    A fixed-parameter tractability result for multicommodity demand flow in trees
    Download  theinf1.informatik.uni-jena.de
    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
    claim paper
    Read More »
    IPL
    2006
    84views more  IPL 2006»
    On the hardness of approximating Max-Satisfy
    14 years 17 days ago
    On the hardness of approximating Max-Satisfy
    Download  research.microsoft.com
    Max-Satisfy is the problem of finding an assignment that satisfies the maximum number of equations in a system of linear equations over Q. We prove that unless NPBPP Max-Satisfy c...
    Uriel Feige, Daniel Reichman
    claim paper
    Read More »
    IPL
    2006
    139views more  IPL 2006»
    An adjustable linear time parallel algorithm for maximum weight bipartite matching
    14 years 17 days ago
    An adjustable linear time parallel algorithm for maximum weight bipartite matching
    Download  www.ece.neu.edu
    We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing
    Morteza Fayyazi, David R. Kaeli, Waleed Meleis
    claim paper
    Read More »
    « first‹ previous12345678next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.