Sciweavers

1922 search results - page 146 / 385
» ie 2007
Sort
View
83
Voted
MA
2011
Springer
193views Communications» more  MA 2011»
14 years 7 months ago
Spatial autoregressive and moving average Hilbertian processes
Since the initial work on spatial statistical models developed in Bhattacharyya, Khalil and Richardson (1996), Basu and Reinsel (1993), Güyon (1995), Martin (1979, 1990, 1996), Ja...
María Dolores Ruiz-Medina
98
Voted
DLT
2006
15 years 2 months ago
Finding Lower Bounds for Nondeterministic State Complexity Is Hard
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
Hermann Gruber, Markus Holzer
151
Voted
IJCAI
1989
15 years 1 months ago
Negotiation and Task Sharing Among Autonomous Agents in Cooperative Domains
Research in Distributed Artificial Intelligence is concerned with how automated agents can be designed to interact effectively. One important capability that could aid inter-agent...
Gilad Zlotkin, Jeffrey S. Rosenschein
IJON
2007
100views more  IJON 2007»
15 years 21 days ago
Minimum range approach to blind partial simultaneous separation of bounded sources: Contrast and discriminacy properties
The blind source separation (BSS) problem is often solved by maximizing objective functions reflecting the statistical independence between outputs. Since global maximization may...
Frédéric Vrins, Dinh-Tuan Pham
109
Voted
ALENEX
2007
102views Algorithms» more  ALENEX 2007»
15 years 2 months ago
Linearization: Locally Self-Stabilizing Sorting in Graphs
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
Melih Onus, Andréa W. Richa, Christian Sche...