Sciweavers

447 search results - page 29 / 90
» Decision trees with minimal costs
Sort
View
ECCC
2007
180views more  ECCC 2007»
13 years 8 months ago
Adaptive Algorithms for Online Decision Problems
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
Elad Hazan, C. Seshadhri
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
14 years 2 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu
ZEUS
2010
153views Communications» more  ZEUS 2010»
13 years 10 months ago
Estimating costs of a service
When designing a publicly available Web service, a service designer has to take care of costs and revenue caused by this services. In the very beginning possible partners might onl...
Christian Gierds, Jan Sürmeli
MICRO
2005
IEEE
126views Hardware» more  MICRO 2005»
14 years 2 months ago
Cost Sensitive Modulo Scheduling in a Loop Accelerator Synthesis System
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
Kevin Fan, Manjunath Kudlur, Hyunchul Park, Scott ...
AINA
2005
IEEE
14 years 2 months ago
Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
Bing-Hong Liu, Ming-Jer Tsai, Wei-Chei Ko