692 search results - page 47 / 139 » BDD minimization for approximate computing |
STOC
2003
ACM
15 years 11 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
CANS
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. We consider generic Garbled Circuit (GC)-based techniques for Secure Function Evaluation (SFE) in the semi-honest model. We describe efficient GC constructions for additi...
TON
2008
14 years 10 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
ICFCA
2007
Springer
15 years 5 months ago
2007
Springer
We model a Digital Library as a formal context in which objects are documents and attributes are terms describing documents contents. A formal concept is very close to the notion o...
109
click to vote
CVGIP
2006
14 years 11 months ago
2006
In this paper, we detail an anatomically inspired, physically based model of the human torso designed for the visual simulation of respiration using a mixed system of rigid and de...