Sciweavers

2252 search results - page 409 / 451
» Improving Random Forests
Sort
View
ALT
2003
Springer
14 years 6 months ago
Learning a Subclass of Regular Patterns in Polynomial Time
An algorithm for learning a subclass of erasing regular pattern languages is presented. On extended regular pattern languages generated by patterns π of the form x0α1x1 . . . α...
John Case, Sanjay Jain, Rüdiger Reischuk, Fra...
ICCAD
2001
IEEE
192views Hardware» more  ICCAD 2001»
14 years 6 months ago
BOOM - A Heuristic Boolean Minimizer
We present a two-level Boolean minimization tool (BOOM) based on a new implicant generation paradigm. In contrast to all previous minimization methods, where the implicants are ge...
Jan Hlavicka, Petr Fiser
CVPR
2010
IEEE
14 years 5 months ago
Multi-Class Object Localization by Combining Local Contextual Interactions
Recent work in object localization has shown that the use of contextual cues can greatly improve accuracy over models that use appearance features alone. Although many of these mo...
Carolina Galleguillos, Brian McFee, Gert Lanckriet
CSE
2009
IEEE
14 years 3 months ago
Inferring Unobservable Inter-community Links in Large Social Networks
Abstract—Social networks can be used to model social interactions between individuals. In many circumstances, not all interactions between individuals are observed. In such cases...
Heath Hohwald, Manuel Cebrián, Arturo Canal...
FOCS
2009
IEEE
14 years 3 months ago
Choice-Memory Tradeoff in Allocations
In the classical balls-and-bins paradigm, where n balls are placed independently and uniformly in n bins, typically the number of bins with at least two balls in them is Θ(n) and ...
Noga Alon, Eyal Lubetzky, Ori Gurel-Gurevich