Sciweavers

2252 search results - page 156 / 451
» Improving Random Forests
Sort
View
VLSID
1993
IEEE
136views VLSI» more  VLSID 1993»
14 years 12 days ago
A Simulation-Based Test Generation Scheme Using Genetic Algorithms
This paper discusses a Genetic Algorithm-based method of generating test vectorsfor detecting faults in combinational circuits. The GA-based approach combines the merits of two te...
M. Srinivas, Lalit M. Patnaik
SDM
2007
SIAM
130views Data Mining» more  SDM 2007»
13 years 9 months ago
Towards Attack-Resilient Geometric Data Perturbation
Data perturbation is a popular technique for privacypreserving data mining. The major challenge of data perturbation is balancing privacy protection and data quality, which are no...
Keke Chen, Gordon Sun, Ling Liu
INFOCOM
2011
IEEE
13 years 14 hour ago
Smart sleep: Sleep more to reduce delay in duty-cycled wireless sensor networks
A simple random walk (SRW) has been considered as an effective forwarding method for many applications in wireless sensor networks (WSNs) due to its desirable properties. However...
Chul-Ho Lee, Do Young Eun
STOC
2002
ACM
144views Algorithms» more  STOC 2002»
14 years 8 months ago
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
Surender Baswana, Ramesh Hariharan, Sandeep Sen
TCS
2008
13 years 8 months ago
Competitive graph searches
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul