Sciweavers

33 search results - page 3 / 7
» Building Very Large Neighbour-joining Trees
Sort
View
IDEAS
2008
IEEE
80views Database» more  IDEAS 2008»
14 years 4 days ago
Improved count suffix trees for natural language data
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
Guido Sautter, Cristina Abba, Klemens Böhm
ICCV
2001
IEEE
14 years 7 months ago
Human Tracking with Mixtures of Trees
Tree-structured probabilistic models admit simple, fast inference. However, they are not well suited to phenomena such as occlusion, where multiple components of an object may dis...
Sergey Ioffe, David A. Forsyth
IPPS
2005
IEEE
13 years 11 months ago
A Performance Comparison of Tree and Ring Topologies in Distributed Systems
A distributed system is a collection of computers that are connected via a communication network. Distributed systems have become commonplace due to the wide availability of low-c...
Min Huang, Brett Bode
IPPS
2007
IEEE
14 years 1 days ago
Distributed Aggregation Algorithms with Load-Balancing for Scalable Grid Resource Monitoring
1 Scalable resource monitoring and discovery are essential to the planet-scale infrastructures such as Grids and PlanetLab. This paper proposes a scalable Grid monitoring architect...
Min Cai, Kai Hwang
DATAMINE
1999
108views more  DATAMINE 1999»
13 years 5 months ago
A Survey of Methods for Scaling Up Inductive Algorithms
Abstract. One of the de ning challenges for the KDD research community is to enable inductive learning algorithms to mine very large databases. This paper summarizes, categorizes, ...
Foster J. Provost, Venkateswarlu Kolluri