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
3898
search results - page 16 / 780
»
On the Bit Extraction Problem
Sort
relevance
views
votes
recent
update
View
thumb
title
71
click to vote
ECAI
2004
Springer
108
views
Artificial Intelligence
»
more
ECAI 2004
»
Kernel Machine Based Feature Extraction Algorithms for Regression Problems
15 years 3 months ago
Download
www.sztaki.hu
Csaba Szepesvári, András Kocsor, Kor...
claim paper
Read More »
76
click to vote
PR
2008
74
views
more
PR 2008
»
Feature extraction for classification problems and its application to face recognition
14 years 9 months ago
Download
madang.ajou.ac.kr
Nojun Kwak
claim paper
Read More »
68
click to vote
ICIP
2010
IEEE
195
views
Image Processing
»
more
ICIP 2010
»
A fourth order dual method for staircase reduction in texture extraction and image restoration problems
14 years 7 months ago
Download
ftp.math.ucla.edu
We propose a fourth order dual method for the minimization of the non-smooth semi-norm
Tony F. Chan, Selim Esedoglu, Frederick E. Park
claim paper
Read More »
86
click to vote
COR
2011
205
views
Applied Computing
»
more
COR 2011
»
An exact approach to the problem of extracting an embedded network matrix
14 years 4 months ago
Download
www.optimization-online.org
Rosa M. V. Figueiredo, Martine Labbé, Cid C...
claim paper
Read More »
73
click to vote
GI
2007
Springer
93
views
Theoretical Computer Science
»
more
GI 2007
»
On Factoring Arbitrary Integers with Known Bits
15 years 3 months ago
Download
eprint.iacr.org
: We study the factoring with known bits problem, where we are given a composite integer N = p1p2 . . . pr and oracle access to the bits of the prime factors pi, i = 1, . . . , r. ...
Mathias Herrmann, Alexander May
claim paper
Read More »
« Prev
« First
page 16 / 780
Last »
Next »