Sciweavers

2168 search results - page 124 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
ICAISC
2010
Springer
15 years 8 months ago
An Evolutionary Algorithm for Global Induction of Regression Trees
In the paper a new evolutionary algorithm for induction of univariate regression trees is proposed. In contrast to typical top-down approaches it globally searches for the best tre...
Marek Kretowski, Marcin Czajkowski
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
15 years 5 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
16 years 20 days ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi
VDB
1998
117views Database» more  VDB 1998»
15 years 4 months ago
Textural Features and Relevance Feedback for Image Retrieval
This paper focuses on the retrieval of complex images based on their textural content. We use GMRF for texture discrimination and a region-growing algorithm for texture segmentati...
Eugenio Di Sciascio, Giacomo Piscitelli, Augusto C...
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
16 years 3 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais