Sciweavers

7522 search results - page 1129 / 1505
» Spacing memetic algorithms
Sort
View
ICASSP
2010
IEEE
15 years 4 months ago
Graph-spectrum-based neural spike features for stereotrodes and tetrodes
Extracellular recording of neural signals records the action potentials (known as spikes) of neurons adjacent to the electrode as well as the noise generated by the overall neural...
Yasser Ghanbari, Panos Papamichalis, Larry Spence
CGF
2008
84views more  CGF 2008»
15 years 4 months ago
Frame Sequential Interpolation for Discrete Level-of-Detail Rendering
In this paper we present a method for automatic interpolation between adjacent discrete levels of detail to achieve smooth LOD changes in image space. We achieve this by breaking ...
Daniel Scherzer, Michael Wimmer
COMCOM
2008
102views more  COMCOM 2008»
15 years 4 months ago
Bluebot: Asset tracking via robotic location crawling
From manufacturers, distributors, and retailers of consumer goods to government departments, enterprises of all kinds are gearing up to use RFID technology to increase the visibil...
Abhishek Patil, Jonathan Munson, David Wood, Alan ...
CORR
2010
Springer
112views Education» more  CORR 2010»
15 years 4 months ago
On Finding Frequent Patterns in Event Sequences
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
Andrea Campagna, Rasmus Pagh
EOR
2008
75views more  EOR 2008»
15 years 4 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist
« Prev « First page 1129 / 1505 Last » Next »