Sciweavers

9842 search results - page 1881 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ATAL
2007
Springer
14 years 1 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...
CIKM
2007
Springer
14 years 1 months ago
A dual-view approach to interactive network visualization
Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network...
Galileo Namata, Brian Staats, Lise Getoor, Ben Shn...
ECAL
2007
Springer
14 years 1 months ago
Multi-level Selection in the Emergence of Language Systematicity
Language can be viewed as a complex adaptive system which is continuously shaped and reshaped by the actions of its users as they try to solve communicative problems. To maintain c...
Luc Steels, Remi van Trijp, Pieter Wellens
ESA
2007
Springer
176views Algorithms» more  ESA 2007»
14 years 1 months ago
Arrangements in Geometry: Recent Advances and Challenges
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research. In this talk I...
Micha Sharir
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
14 years 1 months ago
Optimal nesting of species for exact cover of resources: two against many
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
Jeffrey Horn
« Prev « First page 1881 / 1969 Last » Next »