Sciweavers

2523 search results - page 118 / 505
» Objective: In Minimum Context
Sort
View
JSYML
2006
124views more  JSYML 2006»
15 years 4 months ago
Glivenko theorems for substructural logics over FL
It is well known that classical propositional logic can be interpreted in intuitionistic propositional logic. In particular Glivenko's theorem states that a formula is provabl...
Nikolaos Galatos, Hiroakira Ono
JCO
2007
130views more  JCO 2007»
15 years 4 months ago
On edge orienting methods for graph coloring
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
Bernard Gendron, Alain Hertz, Patrick St-Louis
ADMA
2010
Springer
314views Data Mining» more  ADMA 2010»
15 years 2 months ago
Best Clustering Configuration Metrics: Towards Multiagent Based Clustering
Multi-Agent Clustering (MAC) requires a mechanism for identifying the most appropriate cluster configuration. This paper reports on experiments conducted with respect to a number o...
Santhana Chaimontree, Katie Atkinson, Frans Coenen
SIGMOD
2005
ACM
254views Database» more  SIGMOD 2005»
16 years 4 months ago
Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
Kyriakos Mouratidis, Marios Hadjieleftheriou, Dimi...
TKDE
2010
185views more  TKDE 2010»
15 years 2 months ago
Superseding Nearest Neighbor Search on Uncertain Spatial Databases
This paper proposes a new problem, called superseding nearest neighbor search, on uncertain spatial databases, where each object is described by a multidimensional probability den...
Sze Man Yuen, Yufei Tao, Xiaokui Xiao, Jian Pei, D...