Sciweavers

1629 search results - page 298 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
CC
2006
Springer
122views System Software» more  CC 2006»
15 years 1 months ago
Context-Sensitive Points-to Analysis: Is It Worth It?
We present the results of an empirical study evaluating the precision of subset-based points-to analysis with several variations of context sensitivity on Java benchmarks of signif...
Ondrej Lhoták, Laurie J. Hendren
TROB
2008
93views more  TROB 2008»
14 years 9 months ago
Using Sensor Morphology for Multirobot Formations
In formation-maintenance (formation control) tasks, robots maintain their relative position with respect to their peers, according to a desired geometric shape. Previous work has e...
Gal A. Kaminka, Ruti Schechter-Glick, Vladimir Sad...
BMCBI
2005
162views more  BMCBI 2005»
14 years 9 months ago
Accelerated probabilistic inference of RNA structure evolution
Background: Pairwise stochastic context-free grammars (Pair SCFGs) are powerful tools for evolutionary analysis of RNA, including simultaneous RNA sequence alignment and secondary...
Ian Holmes
HUC
2010
Springer
14 years 10 months ago
ElectriSense: single-point sensing using EMI for electrical event detection and classification in the home
This paper presents ElectriSense, a new solution for automatically detecting and classifying the use of electronic devices in a home from a single point of sensing. ElectriSense r...
Sidhant Gupta, Matthew S. Reynolds, Shwetak N. Pat...
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
15 years 10 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson