Sciweavers

2373 search results - page 251 / 475
» Complexities for generalized models of self-assembly
Sort
View
ACSC
2008
IEEE
16 years 1 months ago
Privacy preserving set intersection based on bilinear groups
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
Yingpeng Sang, Hong Shen
TACAS
2009
Springer
136views Algorithms» more  TACAS 2009»
16 years 1 months ago
Path Feasibility Analysis for String-Manipulating Programs
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
Nikolaj Bjørner, Nikolai Tillmann, Andrei V...
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
16 years 1 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
CRV
2008
IEEE
295views Robotics» more  CRV 2008»
16 years 1 months ago
3D Human Motion Tracking Using Dynamic Probabilistic Latent Semantic Analysis
We propose a generative statistical approach to human motion modeling and tracking that utilizes probabilistic latent semantic (PLSA) models to describe the mapping of image featu...
Kooksang Moon, Vladimir Pavlovic
ICASSP
2008
IEEE
16 years 1 months ago
Deformable trellis: open contour tracking in bio-image sequences
This paper presents an open contour tracking method that employs an arc-emission Hidden Markov Model (HMM). The algorithm encodes the shape information of the structure in a spati...
Mehmet Emre Sargin, Alphan Altinok, Kenneth Rose, ...