Sciweavers

203 search results - page 35 / 41
» Decision Tree Pruning as a Search in the State Space
Sort
View
IR
2008
13 years 7 months ago
A compressed self-index using a Ziv-Lempel dictionary
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
Luís M. S. Russo, Arlindo L. Oliveira
ATAL
2006
Springer
13 years 11 months ago
Integrating parallel interactions into cooperative search
In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the...
Efrat Manisterski, David Sarne, Sarit Kraus
SOFSEM
2000
Springer
13 years 11 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
PVLDB
2008
127views more  PVLDB 2008»
13 years 7 months ago
Discovering data quality rules
Dirty data is a serious problem for businesses leading to incorrect decision making, inefficient daily operations, and ultimately wasting both time and money. Dirty data often ari...
Fei Chiang, Renée J. Miller
DAC
2004
ACM
13 years 11 months ago
Implicit pseudo boolean enumeration algorithms for input vector control
In a CMOS combinational logic circuit, the subthreshold leakage current in the standby state depends on the state of the inputs. In this paper we present a new approach to identif...
Kaviraj Chopra, Sarma B. K. Vrudhula