Sciweavers

2230 search results - page 339 / 446
» Reformulating Constraint Models Using Input Data
Sort
View
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
14 years 11 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre
ICML
2010
IEEE
14 years 11 months ago
Conditional Topic Random Fields
Generative topic models such as LDA are limited by their inability to utilize nontrivial input features to enhance their performance, and many topic models assume that topic assig...
Jun Zhu, Eric P. Xing
CASES
2004
ACM
15 years 3 months ago
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
IPPS
2000
IEEE
15 years 2 months ago
Controlling Distributed Shared Memory Consistency from High Level Programming Languages
One of the keys for the success of parallel processing is the availability of high-level programming languages for on-the-shelf parallel architectures. Using explicit message passi...
Yvon Jégou
NDSS
2008
IEEE
15 years 4 months ago
Analysis-Resistant Malware
Traditionally, techniques for computing on encrypted data have been proposed with privacy preserving applications in mind. Several current cryptosystems support a homomorphic oper...
John Bethencourt, Dawn Song, Brent Waters