Sciweavers

707 search results - page 140 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
PAMI
2008
134views more  PAMI 2008»
13 years 7 months ago
Bittracker - A Bitmap Tracker for Visual Tracking under Very General Conditions
This paper addresses the problem of visual tracking under very general conditions: a possibly nonrigid target whose appearance may drastically change over time, general camera moti...
Ido Leichter, Michael Lindenbaum, Ehud Rivlin
IJFCS
2007
98views more  IJFCS 2007»
13 years 7 months ago
Modular Ranking Abstraction
Ranking Abstraction Ittai Balaban Computer Science Department, New York University, 251 Mercer St., New York, New York 10012, United States and Amir Pnueli Computer Science Departm...
Ittai Balaban, Amir Pnueli, Lenore D. Zuck
ICALP
2010
Springer
13 years 9 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
AI
2010
Springer
13 years 8 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 8 months ago
Connectivity in Sub-Poisson Networks
: We consider a class of point processes, which we call sub-Poisson; these are point processes that can be directionallyconvexly (dcx) dominated by some Poisson point process. The ...
Bartlomiej Blaszczyszyn, D. Yogeshwaran