Sciweavers

2509 search results - page 309 / 502
» Abstract Geometrical Computation and Computable Analysis
Sort
View
145
Voted
TLCA
2005
Springer
15 years 11 months ago
The Elimination of Nesting in SPCF
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
James Laird
CVPR
2010
IEEE
15 years 11 months ago
Minimum length in the tangent bundle as a model for curve completion
The phenomenon of visual curve completion, where the visual system completes the missing part (e.g., due to occlusion) between two contour fragments, is a major problem in percept...
Guy Ben-Yosef, Ohad Ben Shahar
DMIN
2009
180views Data Mining» more  DMIN 2009»
15 years 4 months ago
APHID: A Practical Architecture for High-Performance, Privacy-Preserving Data Mining
While the emerging field of privacy preserving data mining (PPDM) will enable many new data mining applications, it suffers from several practical difficulties. PPDM algorithms are...
Jimmy Secretan, Anna Koufakou, Michael Georgiopoul...
166
Voted
ICRA
2007
IEEE
107views Robotics» more  ICRA 2007»
16 years 18 days ago
Real-time keypoints matching: application to visual servoing
Abstract— Many computer vision problems such as recognition, image retrieval, and tracking require matching two images. Currently, ones try to find as reliable as possible match...
Thi-Thanh-Hai Tran, Éric Marchand
ACSC
2003
IEEE
15 years 11 months ago
Symbol Grounding and its Implications for Artificial Intelligence
In response to Searle's well-known Chinese room argument against Strong AI (and more generally, computationalism), Harnad proposed that if the symbols manipulated by a robot ...
Michael J. Mayo