Sciweavers

30 search results - page 2 / 6
» Finding Range Minima in the Middle: Approximations and Appli...
Sort
View
SIGMOD
2004
ACM
144views Database» more  SIGMOD 2004»
14 years 5 months ago
Diamond in the Rough: Finding Hierarchical Heavy Hitters in Multi-Dimensional Data
Data items archived in data warehouses or those that arrive online as streams typically have attributes which take values from multiple hierarchies (e.g., time and geographic loca...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
JAIR
2008
120views more  JAIR 2008»
13 years 5 months ago
Anytime Induction of Low-cost, Low-error Classifiers: a Sampling-based Approach
Machine learning techniques are gaining prevalence in the production of a wide range of classifiers for complex real-world applications with nonuniform testing and misclassificati...
Saher Esmeir, Shaul Markovitch
JMLR
2006
125views more  JMLR 2006»
13 years 5 months ago
Linear Programming Relaxations and Belief Propagation - An Empirical Study
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
Chen Yanover, Talya Meltzer, Yair Weiss
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
13 years 7 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa
TVCG
2011
163views more  TVCG 2011»
13 years 6 days ago
Scan-Based Volume Animation Driven by Locally Adaptive Articulated Registrations
—This paper describes a complete system to create anatomically accurate example-based volume deformation and animation of articulated body regions, starting from multiple in vivo...
Taehyun Rhee, John P. Lewis, Ulrich Neumann, Krish...