Sciweavers

1562 search results - page 96 / 313
» Convenience Over Correctness
Sort
View
COLING
1996
13 years 10 months ago
Identifying the Coding System and Language of On-line Documents on the Internet
This paper proposes a new algorithm that simultaneously identifies the coding system and language of a code string fetched from the Internet, especially World-Wide Web. The algori...
Gen-itiro Kikui
ESA
2010
Springer
227views Algorithms» more  ESA 2010»
13 years 10 months ago
Approximating Parameterized Convex Optimization Problems
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
Joachim Giesen, Martin Jaggi, Sören Laue
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 9 months ago
A proof Procedure for Testing Membership in Regular Expressions
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
Keehang Kwon, Hong Pyo Ha, Jiseung Kim
JPDC
2006
106views more  JPDC 2006»
13 years 9 months ago
Computing nearest neighbors in real time
The nearest-neighbor method can successfully be applied to correct possible errors induced into bit strings transmitted over noisy communication channels or to classify samples in...
Marius Nagy, Selim G. Akl
PR
2008
84views more  PR 2008»
13 years 9 months ago
Practical background estimation for mosaic blending with patch-based Markov random fields
In this paper, we present a new background estimation algorithm which effectively represents both background and foreground. The problem is formulated with a labeling problem over...
Dae Woong Kim, Ki-Sang Hong