Sciweavers

893 search results - page 45 / 179
» P3C: A New Algorithm for the Simple Temporal Problem
Sort
View
STRINGOLOGY
2008
13 years 9 months ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
GECCO
2005
Springer
108views Optimization» more  GECCO 2005»
14 years 1 months ago
Evolving recurrent models using linear GP
Turing complete Genetic Programming (GP) models introduce the concept of internal state, and therefore have the capacity for identifying interesting temporal properties. Surprisin...
Xiao Luo, Malcolm I. Heywood, A. Nur Zincir-Heywoo...
SIGCOMM
2009
ACM
14 years 2 months ago
White space networking with wi-fi like connectivity
Networking over UHF white spaces is fundamentally different from conventional Wi-Fi along three axes: spatial variation, temporal variation, and fragmentation of the UHF spectrum....
Paramvir Bahl, Ranveer Chandra, Thomas Moscibroda,...
RECOMB
2009
Springer
14 years 8 months ago
New Perspectives on Gene Family Evolution: Losses in Reconciliation and a Link with Supertrees
Reconciliation between a set of gene trees and a species tree is the most commonly used approach to infer the duplication and loss events in the evolution of gene families, given a...
Cedric Chauve, Nadia El-Mabrouk
TVCG
1998
129views more  TVCG 1998»
13 years 7 months ago
Splatting Errors and Antialiasing
—This paper describes three new results for volume rendering algorithms utilizing splatting. First, an antialiasing extension to the basic splatting algorithm is introduced that ...
Klaus Mueller, Torsten Möller, J. Edward Swan...