Sciweavers

2373 search results - page 340 / 475
» Complexities for generalized models of self-assembly
Sort
View
FOSSACS
2011
Springer
14 years 10 months ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 9 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
IACR
2011
87views more  IACR 2011»
14 years 6 months ago
Is privacy compatible with truthfulness?
In the area of privacy-preserving data mining, a differentially private mechanism intuitively encourages people to share their data truthfully because they are at little risk of ...
David Xiao
SIGCOMM
2012
ACM
13 years 9 months ago
ShadowStream: performance evaluation as a capability in production internet live streaming networks
As live streaming networks grow in scale and complexity, they are becoming increasingly difficult to evaluate. Existing evaluation methods including lab/testbed testing, simulati...
Chen Tian, Richard Alimi, Yang Richard Yang, David...
PLDI
2012
ACM
13 years 9 months ago
Adaptive input-aware compilation for graphics engines
While graphics processing units (GPUs) provide low-cost and efficient platforms for accelerating high performance computations, the tedious process of performance tuning required...
Mehrzad Samadi, Amir Hormati, Mojtaba Mehrara, Jan...