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
18
click to vote
CIE
2006
Springer
favorite
Email
discuss
report
72
views
Applied Computing
»
more
CIE 2006
»
Can General Relativistic Computers Break the Turing Barrier?
14 years 8 days ago
Download
www.math-inst.hu
István Németi, Hajnal Andréka
Real-time Traffic
Applied Computing
|
CIE 2006
|
claim paper
Related Content
»
From Logic to Physics How the Meaning of Computation Changed over Time
»
Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds
»
Breaking the simulation barrier SRAM evaluation through norm minimization
»
Recognizing Objects in Adversarial Clutter Breaking a Visual CAPTCHA
»
HigherDimensional Affine Registration and Vision Applications
»
The soft heap an approximate priority queue with optimal error rate
more »
Post Info
More Details (n/a)
Added
20 Aug 2010
Updated
20 Aug 2010
Type
Conference
Year
2006
Where
CIE
Authors
István Németi, Hajnal Andréka
Comments
(0)
Researcher Info
Applied Computing Study Group
Computer Vision