Search Sciweavers | Sciweavers

28888 search results - page 304 / 5778

» Computability and complexity in analysis

155

click to vote

APAL
2010

125views more APAL 2010»

The computable Lipschitz degrees of computably enumerable sets are not dense

15 years 6 months ago

Download homepages.msor.vuw.ac.nz

The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...

Adam R. Day

claim paper

Read More »

109

click to vote

CVPR
2001
IEEE

170views Computer Vision» more CVPR 2001»

Text Identification in Complex Background Using SVM

16 years 8 months ago

Download www.cs.cmu.edu

Datong Chen, Hervé Bourlard, Jean-Philippe ...

claim paper

Read More »

144

click to vote

ICPR
2002
IEEE

136views computer vision» more ICPR 2002»

Text Segmentation and Recognition in Complex Background Based on Markov Random Field

16 years 7 months ago

Download www.cs.cmu.edu

Datong Chen, Jean-Marc Odobez, Hervé Bourla...

claim paper

Read More »

113

click to vote

CHI
2006
ACM

111views Human Computer Interaction» more CHI 2006»

IT@Home: unraveling complexities of networked devices in the home

16 years 7 months ago

Download research.microsoft.com

David W. McDonald, Bill N. Schilit, Sara A. Bly

claim paper

Read More »

147

click to vote

SPAA
2009
ACM

138views Distributed And Parallel Com...» more SPAA 2009»

On the complexity of the regenerator placement problem in optical networks

16 years 3 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers