Sciweavers

3686 search results - page 293 / 738
» Comprehensive comprehensions
Sort
View
101
Voted
IJON
2006
85views more  IJON 2006»
15 years 3 months ago
From outliers to prototypes: Ordering data
We propose simple and fast methods based on nearest neighbors that order objects from high-dimensional data sets from typical points to untypical points. On the one hand, we show ...
Stefan Harmeling, Guido Dornhege, David M. J. Tax,...
JCP
2008
121views more  JCP 2008»
15 years 3 months ago
Algorithms for Identifying the Multiple Syntactic Categories and Meanings of the Word Over
The word over, among others, is associated with a great variety of syntactic categories and meanings. Although over has received attention from scholars in different frameworks for...
Yukiko Sasaki Alam
JMIV
2008
83views more  JMIV 2008»
15 years 3 months ago
On Straight Line Segment Detection
In this paper we propose a comprehensive method for detecting straight line segments in any digital image, accurately controlling both false positive and false negative detections....
Rafael Grompone von Gioi, Jérémie Ja...
JSAT
2008
57views more  JSAT 2008»
15 years 3 months ago
tts: A SAT-Solver for Small, Difficult Instances
The Ternary Tree Solver (tts) is a complete solver for propositional satisfiability which was designed to have good performance on the most difficult small instances. It uses a st...
Ivor Spence
DKE
2007
115views more  DKE 2007»
15 years 3 months ago
An improved methodology on information distillation by mining program source code
This paper presents a methodology for knowledge acquisition from source code. We use data mining to support semiautomated software maintenance and comprehension and provide practi...
Yiannis Kanellopoulos, Christos Makris, Christos T...