Sciweavers

16404 search results - page 422 / 3281
» A set coverage problem
Sort
View
MST
2010
117views more  MST 2010»
15 years 1 months ago
The 1-Versus-2 Queries Problem Revisited
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
Rahul Tripathi
SODA
2010
ACM
162views Algorithms» more  SODA 2010»
16 years 4 months ago
The forest hiding problem
Let be a disk of radius R in the plane. A set F of closed unit disks contained in forms a maximal packing if the unit disks are pairwise disjoint and the set is maximal: i.e., i...
Adrian Dumitrescu, Minghui Jiang
ICPR
2006
IEEE
16 years 23 days ago
Fast Feature Extraction Approach for Multi-Dimension Feature Space Problems
Recently, we proposed a fast feature extraction approach denoted FSOM utilizes Self Organizing Map (SOM). FSOM [1] overcomes the slowness of traditional SOM search algorithm. We i...
Alaa El. Sagheer, Naoyuki Tsuruta, Rin-ichiro Tani...
KI
1999
Springer
15 years 11 months ago
On the Translation of Qualitative Spatial Reasoning Problems into Modal Logics
Among the formalisms for qualitative spatial reasoning, the Region Connection Calculus and its variant, the constraint algebra RCC8, have received particular attention recently. A...
Werner Nutt
DBPL
1993
Springer
95views Database» more  DBPL 1993»
15 years 10 months ago
A Moose and a Fox Can Aid Scientists with Data Management Problems
Fox Finding Objects of eXperiments is the declarative query language for Moose Modeling Objects Of Scienti c Experiments, an object-oriented data model at the core of a scient...
Janet L. Wiener, Yannis E. Ioannidis