Sciweavers

1068 search results - page 169 / 214
» Extremely randomized trees
Sort
View
ESA
1998
Springer
154views Algorithms» more  ESA 1998»
14 years 2 months ago
A Functional Approach to External Graph Algorithms
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
James Abello, Adam L. Buchsbaum, Jeffery Westbrook
FLAIRS
2004
13 years 11 months ago
Concurrent Backtrack Search on DisCSPs
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
Roie Zivan, Amnon Meisels
TCSV
2008
211views more  TCSV 2008»
13 years 9 months ago
Audio-Assisted Movie Dialogue Detection
An audio-assisted system is investigated that detects if a movie scene is a dialogue or not. The system is based on actor indicator functions. That is, functions which define if an...
Margarita Kotti, Dimitrios Ververidis, Georgios Ev...
JAIR
2007
106views more  JAIR 2007»
13 years 9 months ago
Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins...
J. Christopher Beck
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 8 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase