Sciweavers

1007 search results - page 111 / 202
» The Complexity of Futile Questioning
Sort
View
107
Voted
DC
2007
15 years 23 days ago
On private computation in incomplete networks
Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious...
Amos Beimel
CANDC
2005
ACM
15 years 21 days ago
Comments on selected fundamental aspects of microarray analysis
Microarrays are becoming a ubiquitous tool of research in life sciences. However, the working principles of microarray-based methodologies are often misunderstood or apparently ig...
Alessandra Riva, Anne-Sophie Carpentier, Bruno Tor...
101
Voted
ICCV
1999
IEEE
16 years 2 months ago
Euclidean Reconstruction and Reprojection up to Subgroups
The necessary and sufficient conditions for being able to estimate scene structure, motion and camera calibration from a sequence of images are very rarely satisfied in practice. ...
Yi Ma, Stefano Soatto, Jana Kosecka, Shankar Sastr...
96
Voted
STOC
2007
ACM
94views Algorithms» more  STOC 2007»
16 years 1 months ago
Constructing non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky
119
Voted
PODS
2008
ACM
143views Database» more  PODS 2008»
16 years 28 days ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin