Sciweavers

632 search results - page 115 / 127
» On the Approximability of the Steiner Tree Problem
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
13 years 7 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
ICCV
2003
IEEE
14 years 9 months ago
Video Input Driven Animation (VIDA)
There are many challenges associated with the integration of synthetic and real imagery. One particularly difficult problem is the automatic extraction of salient parameters of na...
Meng Sun, Allan D. Jepson, Eugene Fiume
VLDB
2007
ACM
181views Database» more  VLDB 2007»
14 years 7 months ago
STAR: Self-Tuning Aggregation for Scalable Monitoring
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
Navendu Jain, Michael Dahlin, Yin Zhang, Dmitry Ki...
ICDE
2010
IEEE
272views Database» more  ICDE 2010»
14 years 7 months ago
SMARTINT: A System for Answering Queries over Web Databases Using Attribute Dependencies
Many web databases can be seen as providing partial and overlapping information about entities in the world. To answer queries effectively, we need to integrate the information abo...
Ravi Gummadi, Anupam Khulbe, Aravind Kalavagattu, ...
AAIM
2009
Springer
98views Algorithms» more  AAIM 2009»
14 years 2 months ago
Latency Constrained Aggregation in Chain Networks Admits a PTAS
This paper studies the aggregation of messages in networks that consist of a chain of nodes, and each message is time-constrained such that it needs to be aggregated during a give...
Tim Nonner, Alexander Souza