Sciweavers

6365 search results - page 46 / 1273
» Fast Local Computation Algorithms
Sort
View
109
Voted
NIPS
2003
15 years 1 months ago
On the Concentration of Expectation and Approximate Inference in Layered Networks
We present an analysis of concentration-of-expectation phenomena in layered Bayesian networks that use generalized linear models as the local conditional probabilities. This frame...
XuanLong Nguyen, Michael I. Jordan
EUROGRAPHICS
2010
Eurographics
15 years 8 months ago
TouchTone: Interactive Local Image Adjustment Using Point-and-Swipe
Recent proliferation of camera phones, photo sharing and social network services has significantly changed how we process our photos. Instead of going through the traditional dow...
Chia-Kai Liang, Wei-Chao Chen, Natasha Gelfand
113
Voted
ICML
1998
IEEE
16 years 1 months ago
A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
Michael J. Kearns, Yishay Mansour
117
Voted
DATE
2000
IEEE
93views Hardware» more  DATE 2000»
15 years 5 months ago
Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
Xiaoping Tang, D. F. Wong, Ruiqi Tian
105
Voted
INFOCOM
1995
IEEE
15 years 4 months ago
A Fast Bypass Algorithm for High-Speed Networks
In this work we suggest an algorithm that increases the reservation success probability for bursty tra c in high speed networks by adding exibility to the construction of the rout...
Israel Cidon, Raphael Rom, Yuval Shavitt