Sciweavers

3946 search results - page 202 / 790
» The computational complexity of choice sets
Sort
View
PLDI
2009
ACM
16 years 7 months ago
Chameleon: adaptive selection of collections
Languages such as Java and C#, as well as scripting languages like Python, and Ruby, make extensive use of Collection classes. A collection implementation represents a fixed choic...
Ohad Shacham, Martin T. Vechev, Eran Yahav
IROS
2009
IEEE
148views Robotics» more  IROS 2009»
16 years 1 months ago
On the error analysis of vertical line pair-based monocular visual odometry in urban area
Abstract— When a robot travels in urban area, Global Positional System (GPS) signals might be obstructed by buildings. Hence visual odometry is a choice. We notice that the verti...
Ji Zhang, Dezhen Song
FSTTCS
2004
Springer
16 years 18 hour ago
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Gerold Jäger, Anand Srivastav
NC
2008
122views Neural Networks» more  NC 2008»
15 years 6 months ago
Computation with finite stochastic chemical reaction networks
A highly desired part of the synthetic biology toolbox is an embedded chemical microcontroller, capable of autonomously following a logic program specified by a set of instructions...
David Soloveichik, Matthew Cook, Erik Winfree, Jeh...
STOC
2012
ACM
236views Algorithms» more  STOC 2012»
13 years 9 months ago
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
We propose a new notion of secure multiparty computation aided by a computationally-powerful but untrusted “cloud” server. In this notion that we call on-the-fly multiparty c...
Adriana López-Alt, Eran Tromer, Vinod Vaiku...