Sciweavers

615 search results - page 6 / 123
» Completeness of Combinations of Constructor Systems
Sort
View
ENTCS
2007
111views more  ENTCS 2007»
13 years 7 months ago
Extra Variables Can Be Eliminated from Functional Logic Programs
Programs in modern functional logic languages are rewrite systems following the constructor discipline but where confluence and termination are not required, thus defining possi...
Javier de Dios Castro, Francisco Javier Lóp...
CICLING
2011
Springer
12 years 11 months ago
Wikipedia Vandalism Detection: Combining Natural Language, Metadata, and Reputation Features
Wikipedia is an online encyclopedia which anyone can edit. While most edits are constructive, about 7% are acts of vandalism. Such behavior is characterized by modifications made ...
B. Thomas Adler, Luca de Alfaro, Santiago Mois&eac...
VCIP
2003
146views Communications» more  VCIP 2003»
13 years 8 months ago
A segmentation system with model-assisted completion of video objects
This paper presents a new algorithm for video-object segmentation, which combines motion-based segmentation, high-level object-model detection, and spatial segmentation into a sin...
Dirk Farin, Peter H. N. de With, Wolfgang Effelsbe...
EXPERT
1998
83views more  EXPERT 1998»
13 years 7 months ago
Data-Driven Constructive Induction
Constructive induction divides the problem of learning an inductive hypothesis into two intertwined searches: one—for the “best” representation space, and two—for the “be...
Eric Bloedorn, Ryszard S. Michalski
APAL
2005
115views more  APAL 2005»
13 years 7 months ago
Completeness of S4 with respect to the real line: revisited
We prove that S4 is complete with respect to Boolean combinations of countable unions of convex subsets of the real line, thus strengthening a 1944 result of McKinsey and Tarski (...
Guram Bezhanishvili, Mai Gehrke