Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
26
click to vote
PAAPP
2007
favorite
Email
discuss
report
105
views
more
PAAPP 2007
»
Computational complexity of weighted splitting schemes on parallel computers
13 years 10 months ago
Download
parallel.bas.bg
P. Csomós, Ivan Dimov, István Farag&
Real-time Traffic
PAAPP 2007
|
claim paper
Related Content
»
Acceleration of adaptive proximal forwardbackward splitting method and its application to ...
»
False name manipulations in weighted voting games splitting merging and annexation
»
Parameterized splitting systems for the discrete logarithm
»
The computational complexity of the parallel knockout problem
»
A ProvenanceAware Weighted Fault Tolerance Scheme for ServiceBased Applications
»
Bandwidth Clustering for Reliable and Prioritized Network Routing Using Split AgentBased M...
»
DEFT Distributed ExponentiallyWeighted Flow Splitting
»
An on Demand Path Marking and Capacity Reservation Method using Split Agent
»
Parallel Multiparty Computation from Linear Multisecret Sharing Schemes
more »
Post Info
More Details (n/a)
Added
27 Dec 2010
Updated
27 Dec 2010
Type
Journal
Year
2007
Where
PAAPP
Authors
P. Csomós, Ivan Dimov, István Faragó, Ágnes Havasi, Tzvetan Ostromsky
Comments
(0)
Researcher Info
PAAPP 1998 Study Group
Computer Vision