Sciweavers

693 search results - page 90 / 139
» Complexity Analysis of Heuristic CSP Search Algorithms
Sort
View
SPAA
2010
ACM
14 years 24 days ago
Towards optimizing energy costs of algorithms for shared memory architectures
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...
Vijay Anand Korthikanti, Gul Agha
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
14 years 8 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
FMCO
2005
Springer
143views Formal Methods» more  FMCO 2005»
14 years 1 months ago
Orion: High-Precision Methods for Static Error Analysis of C and C++ Programs
Abstract. We describe the algorithmic and implementation ideas behind a tool, Orion, for finding common programming errors in C and C++ programs using static code analysis. We aim...
Dennis Dams, Kedar S. Namjoshi
JSC
2010
107views more  JSC 2010»
13 years 6 months ago
Solving the conjugacy problem in Garside groups by cyclic sliding
1 We present a solution to the conjugacy decision problem and the conjugacy search problem2 in Garside groups, which is theoretically simpler than the usual one, with no loss of e...
Volker Gebhardt, Juan González-Meneses
WWW
2011
ACM
13 years 2 months ago
Limiting the spread of misinformation in social networks
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...
Ceren Budak, Divyakant Agrawal, Amr El Abbadi