Sciweavers

2190 search results - page 415 / 438
» An optimal algorithm to generate tilings
Sort
View
SIGSOFT
2006
ACM
15 years 7 months ago
Bit level types for high level reasoning
Bitwise operations are commonly used in low-level systems code to access multiple data fields that have been packed into a single word. Program analysis tools that reason about s...
Ranjit Jhala, Rupak Majumdar
SIGIR
2005
ACM
15 years 7 months ago
Linear discriminant model for information retrieval
This paper presents a new discriminative model for information retrieval (IR), referred to as linear discriminant model (LDM), which provides a flexible framework to incorporate a...
Jianfeng Gao, Haoliang Qi, Xinsong Xia, Jian-Yun N...
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
15 years 7 months ago
Tolerant Locally Testable Codes
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
Venkatesan Guruswami, Atri Rudra
ILP
2004
Springer
15 years 7 months ago
A Monte Carlo Study of Randomised Restarted Search in ILP
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
Filip Zelezný, Ashwin Srinivasan, David Pag...
INDOCRYPT
2004
Springer
15 years 7 months ago
Advances in Alternative Non-adjacent Form Representations
Abstract. From several decades, non-adjacent form (NAF) representations for integers have been extensively studied as an alternative to the usual binary number system where digits ...
Gildas Avoine, Jean Monnerat, Thomas Peyrin