Sciweavers

2492 search results - page 137 / 499
» On the General Signature Trees
Sort
View
JMLR
2010
146views more  JMLR 2010»
15 years 1 months ago
Nonparametric Tree Graphical Models
We introduce a nonparametric representation for graphical model on trees which expresses marginals as Hilbert space embeddings and conditionals as embedding operators. This formul...
Le Song, Arthur Gretton, Carlos Guestrin
DAC
2008
ACM
16 years 7 months ago
DeFer: deferred decision making enabled fixed-outline floorplanner
In this paper, we present DeFer -- a fast, high-quality and nonstochastic fixed-outline floorplanning algorithm. DeFer generates a non-slicing floorplan by compacting a slicing fl...
Jackey Z. Yan, Chris Chu
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 10 months ago
On the Communication Complexity of Read-Once AC^0 Formulae
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra
ALMOB
2007
129views more  ALMOB 2007»
15 years 6 months ago
Consistency of the Neighbor-Net Algorithm
Background: Neighbor-Net is a novel method for phylogenetic analysis that is currently being widely used in areas such as virology, bacteriology, and plant evolution. Given an inp...
David Bryant, Vincent Moulton, Andreas Spillner
TPDS
2008
136views more  TPDS 2008»
15 years 6 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...