Sciweavers

2801 search results - page 466 / 561
» On the Adequateness of the Connection Method
Sort
View
NIPS
2007
14 years 11 months ago
Neural characterization in partially observed populations of spiking neurons
Point process encoding models provide powerful statistical methods for understanding the responses of neurons to sensory stimuli. Although these models have been successfully appl...
Jonathan Pillow, Peter E. Latham
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
14 years 11 months ago
Minimum weight convex Steiner partitions
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
Adrian Dumitrescu, Csaba D. Tóth
WICON
2008
14 years 11 months ago
Constructing accurate, space-efficient, wireless coverage maps for vehicular contexts
Wireless connectivity for vehicles is a fast-growing market, with a plethora of different network technologies already in use. Surveys of the numbers of IEEE 802.11b/g access poin...
David N. Cottingham, Robert K. Harle, Andy Hopper
AAAI
2006
14 years 11 months ago
Learning Partially Observable Action Schemas
We present an algorithm that derives actions' effects and preconditions in partially observable, relational domains. Our algorithm has two unique features: an expressive rela...
Dafna Shahaf, Eyal Amir
ALENEX
2004
107views Algorithms» more  ALENEX 2004»
14 years 11 months ago
An Experimental Analysis of a Compact Graph Representation
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...
Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash