Sciweavers

205 search results - page 17 / 41
» Decision trees do not generalize to new variations
Sort
View
IJIT
2004
15 years 7 months ago
Computing Entropy for Ortholog Detection
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
Hsing-Kuo Pao, John Case
SENSYS
2009
ACM
16 years 26 days ago
Integrated distributed energy awareness for wireless sensor networks
Energy in sensor networks is a distributed, non-transferable resource. Over time, differences in energy availability are likely to arise. Protocols like routing trees may concent...
Geoffrey Werner Challen, Jason Waterman, Matt Wels...
FOCS
2005
IEEE
15 years 11 months ago
Lower Bounds for the Noisy Broadcast Problem
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
Navin Goyal, Guy Kindler, Michael E. Saks
SAC
2003
ACM
15 years 11 months ago
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
Günther R. Raidl, Bryant A. Julstrom
ICCV
2005
IEEE
16 years 8 months ago
Class-Specific Material Categorisation
Although a considerable amount of work has been published on material classification, relatively little of it studies situations with considerable variation within each class. Man...
Barbara Caputo, Eric Hayman, P. Mallikarjuna