Sciweavers

381 search results - page 33 / 77
» On the advantage over a random assignment
Sort
View
ADMA
2006
Springer
110views Data Mining» more  ADMA 2006»
13 years 11 months ago
Learning with Local Drift Detection
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Gladys Castillo
IJCAI
2003
13 years 9 months ago
Toward Conditional Models of Identity Uncertainty with Application to Proper Noun Coreference
Coreference analysis, also known as record linkage or identity uncertainty, is a difficult and important problem in natural language processing, databases, citation matching and ...
Andrew McCallum, Ben Wellner
COMCOM
2007
174views more  COMCOM 2007»
13 years 8 months ago
Directional geographical routing for real-time video communications in wireless sensor networks
In this paper, we address the problem of real-time video streaming over a bandwidth and energy constrained wireless sensor network (WSN) from a small number of dispersed video-sen...
Min Chen, Victor C. M. Leung, Shiwen Mao, Yong Yua...
CLUSTER
2011
IEEE
12 years 7 months ago
Incorporating Network RAM and Flash into Fast Backing Store for Clusters
—We present Nswap2L, a fast backing storage system for general purpose clusters. Nswap2L implements a single device interface on top of multiple heterogeneous physical storage de...
Tia Newhall, Douglas Woos
ECCV
2008
Springer
14 years 6 months ago
Toward Global Minimum through Combined Local Minima
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee