Sciweavers

9730 search results - page 1493 / 1946
» Relating models of backtracking
Sort
View
DCOSS
2006
Springer
15 years 10 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
ICCV
1995
IEEE
15 years 10 months ago
Recognizing 3D Objects Using Photometric Invariant
In this paper we describe a new e cient algorithm for recognizing 3D objects by combining photometric and geometric invariants. Some photometric properties are derived, that are i...
Kenji Nagao
CIKM
2008
Springer
15 years 9 months ago
Intra-document structural frequency features for semi-supervised domain adaptation
In this work we try to bridge the gap often encountered by researchers who find themselves with few or no labeled examples from their desired target domain, yet still have access ...
Andrew Arnold, William W. Cohen
ICALP
2010
Springer
15 years 8 months ago
From Secrecy to Soundness: Efficient Verification via Secure Computation
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
EJC
2008
15 years 8 months ago
Center Fragments for Upscaling and Verification in Database Semantics
The notion of a fragment was coined by Montague 1974 to illustrate the formal handling of certain puzzles, such as de dicto/de re, in a truth-conditional semantics for natural lan...
Roland Hausser
« Prev « First page 1493 / 1946 Last » Next »