Sciweavers

3547 search results - page 134 / 710
» Computers Seeing People
Sort
View
ICPR
2006
IEEE
16 years 5 months ago
Estimating the location of illuminants in realist master paintings Computer image analysis addresses a debate in art history of
In cast-shadow analysis one merely draws a line between each occluder and its associated shadow cast onto a different surface, possibly with wedges indicating precision. In some c...
ALMOB
2008
131views more  ALMOB 2008»
15 years 4 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
COMGEO
2006
ACM
15 years 4 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
153
Voted
CORR
2007
Springer
173views Education» more  CORR 2007»
15 years 3 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge
139
Voted
WETICE
2009
IEEE
15 years 10 months ago
Cloud Computing and the Lessons from the Past
— The skyrocketing demand for a new generation of cloud-based consumer and business applications is driving the need for next generation of datacenters that must be massively sca...
Rao Mikkilineni, Vijay Sarathy