Sciweavers

400 search results - page 64 / 80
» Hard Problem Generation for MKP
Sort
View
ATAL
2007
Springer
15 years 3 months ago
Conditional random fields for activity recognition
Activity recognition is a key component for creating intelligent, multi-agent systems. Intrinsically, activity recognition is a temporal classification problem. In this paper, we...
Douglas L. Vail, Manuela M. Veloso, John D. Laffer...
DNA
2007
Springer
176views Bioinformatics» more  DNA 2007»
15 years 3 months ago
Asynchronous Spiking Neural P Systems: Decidability and Undecidability
In search for “realistic” bio-inspired computing models, we consider asynchronous spiking neural P systems, in the hope to get a class of computing devices with decidable prope...
Matteo Cavaliere, Ömer Egecioglu, Oscar H. Ib...
SSD
2007
Springer
243views Database» more  SSD 2007»
15 years 3 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
INFOCOM
2006
IEEE
15 years 3 months ago
The Internet Dark Matter - on the Missing Links in the AS Connectivity Map
Abstract— The topological structure of the Internet infrastructure is an important and interesting subject that attracted significant research attention in the last few years. A...
Rami Cohen, Danny Raz
ATAL
2003
Springer
15 years 2 months ago
A method for decentralized clustering in large multi-agent systems
This paper examines a method of clustering within a fully decentralized multi-agent system. Our goal is to group agents with similar objectives or data, as is done in traditional ...
Elth Ogston, Benno J. Overeinder, Maarten van Stee...