Sciweavers

857 search results - page 98 / 172
» Maximum Entropy Utility
Sort
View
CVPR
2007
IEEE
14 years 10 months ago
Robust Click-Point Linking: Matching Visually Dissimilar Local Regions
This paper presents robust click-point linking: a novel localized registration framework that allows users to interactively prescribe where the accuracy has to be high. By emphasi...
Kazunori Okada, Xiaolei Huang
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
14 years 9 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
KDD
2005
ACM
149views Data Mining» more  KDD 2005»
14 years 2 months ago
A distributed learning framework for heterogeneous data sources
We present a probabilistic model-based framework for distributed learning that takes into account privacy restrictions and is applicable to scenarios where the different sites ha...
Srujana Merugu, Joydeep Ghosh
ISI
2008
Springer
13 years 8 months ago
Probabilistic frameworks for privacy-aware data mining
Often several cooperating parties would like to have a global view of their joint data for various data mining objectives, but cannot reveal the contents of individual records due...
Joydeep Ghosh
HPCC
2009
Springer
14 years 1 months ago
A Study of Bare PC Web Server Performance for Workloads with Dynamic and Static Content
—Bare PC applications do not use an operating system or kernel. The bare PC architecture avoids buffer copying, minimizes interrupts, uses a single thread of execution for proces...
Long He, Ramesh K. Karne, Alexander L. Wijesinha, ...