Sciweavers

419 search results - page 8 / 84
» Succincter
Sort
View
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
14 years 6 days ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...
FLOPS
2010
Springer
15 years 4 months ago
A Pearl on SAT Solving in Prolog
A succinct SAT solver is presented that exploits the control provided by delay declarations to implement watched literals and unit propagation. Despite its brevity the solver is su...
Jacob M. Howe, Andy King
IFL
2007
Springer
146views Formal Methods» more  IFL 2007»
15 years 3 months ago
A Supercompiler for Core Haskell
Haskell is a functional language, with features such as higher order functions and lazy evaluation, which allow succinct programs. These high-level features present many challenges...
Neil Mitchell, Colin Runciman
LICS
2002
IEEE
15 years 2 months ago
Temporal Logic with Forgettable Past
We investigate NLTL, a linear-time temporal logic with forgettable past. NLTL can be exponentially more succinct than LTL + Past (which in turn can be more succinct than LTL). We ...
François Laroussinie, Nicolas Markey, Ph. S...
ANTS
2006
Springer
139views Algorithms» more  ANTS 2006»
15 years 1 months ago
Hard Instances of the Constrained Discrete Logarithm Problem
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
Ilya Mironov, Anton Mityagin, Kobbi Nissim