Sciweavers

14518 search results - page 258 / 2904
» Two Problems for Sophistication
Sort
View
DSS
2007
112views more  DSS 2007»
15 years 1 months ago
Service-based P2P overlay network for collaborative problem solving
This paper describes a service-based P2P overlay network architecture to support a collaborative environment for solving complex business processes over the network. In the propos...
Sanjay Goel, Shashishekara S. Talya, Michael W. So...
94
Voted
DCG
2002
76views more  DCG 2002»
15 years 26 days ago
The Unit Distance Problem for Centrally Symmetric Convex Polygons
Let f(n) be the maximum number of unit distances determined by the vertices of a convex n-gon. Erdos and Moser conjectured that this function is linear. Supporting this conjecture...
Bernardo M. Ábrego, Silvia Fernández...
95
Voted
SIAMCO
2000
137views more  SIAMCO 2000»
15 years 25 days ago
On a Class of Diffeomorphic Matching Problems in One Dimension
We study a class of functional which can be used for matching objects which can be represented as mappings from a fixed interval, I, to some "feature space." This class o...
Alain Trouvé, Laurent Younes
NETWORKS
2002
15 years 21 days ago
Node-disjoint paths and related problems on hierarchical cubic networks
An n-dimensional hierarchical cubic network (denoted by HCN(n)) contains 2 n n-dimensional hypercubes. The diameter of the HCN(n), which is equal to n+(n+1)/3+1, is about two-thir...
Jung-Sheng Fu, Gen-Huey Chen, Dyi-Rong Duh
78
Voted
LOGCOM
2010
96views more  LOGCOM 2010»
14 years 11 months ago
The Complexity of the Warranted Formula Problem in Propositional Argumentation
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
Robin Hirsch, Nikos Gorogiannis