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
2214
search results - page 14 / 443
»
complexity 2004
Sort
relevance
views
votes
recent
update
View
thumb
title
16
click to vote
CLEF
2004
Springer
95
views
Information Technology
»
more
CLEF 2004
»
Evaluation of Complex Temporal Questions in CLEF-QA
14 years 28 days ago
Download
www.clef-campaign.org
Estela Saquete, José Luis Vicedo Gonz&aacut...
claim paper
Read More »
17
click to vote
EAGC
2004
Springer
97
views
Distributed And Parallel Com...
»
more
EAGC 2004
»
Workflow Support for Complex Grid Applications: Integrated and Portal Solutions
14 years 28 days ago
Download
grid.ucy.ac.cy
Róbert Lovas, Gábor Dózsa, P&...
claim paper
Read More »
24
click to vote
WG
2004
Springer
85
views
Theoretical Computer Science
»
more
WG 2004
»
The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small
14 years 26 days ago
Download
www.lamsade.dauphine.fr
Dominique de Werra, Marc Demange, Jérô...
claim paper
Read More »
21
click to vote
SSWMC
2004
156
views
Security Privacy
»
more
SSWMC 2004
»
On the complexity and hardness of the steganography embedding problem
13 years 9 months ago
Download
www.ece.stevens-tech.edu
We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...
Rajarathnam Chandramouli, Shalin P. Trivedi, R. N....
claim paper
Read More »
21
click to vote
APAL
2004
84
views
more
APAL 2004
»
The Kolmogorov complexity of random reals
13 years 7 months ago
Download
math.nju.edu.cn
We investigate the initial segment complexity of random reals. Let K( ) denote pre
Liang Yu, Decheng Ding, Rodney G. Downey
claim paper
Read More »
« Prev
« First
page 14 / 443
Last »
Next »