Sciweavers

2425 search results - page 64 / 485
» An abstraction of the Lidar measurements
Sort
View
EUROGP
2006
Springer
136views Optimization» more  EUROGP 2006»
15 years 1 months ago
Using Subtree Crossover Distance to Investigate Genetic Programming Dynamics
Abstract. To analyse various properties of the search process of genetic programming it is useful to quantify the distance between two individuals. Using operator-based distance me...
Leonardo Vanneschi, Steven Gustafson, Giancarlo Ma...
CISS
2008
IEEE
15 years 4 months ago
1-Bit compressive sensing
Abstract—Compressive sensing is a new signal acquisition technology with the potential to reduce the number of measurements required to acquire signals that are sparse or compres...
Petros Boufounos, Richard G. Baraniuk
ICGI
2010
Springer
14 years 8 months ago
Rademacher Complexity and Grammar Induction Algorithms: What It May (Not) Tell Us
Abstract. This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessmen...
Sophia Katrenko, Menno van Zaanen
ENTCS
2008
97views more  ENTCS 2008»
14 years 10 months ago
POVMs and Naimark's Theorem Without Sums
duce an abstract notion of POVM within the categorical quantum mechanical semantics in terms act categories. Our definition is justified by two facts: i. we provide a purely graph...
Bob Coecke, Éric Oliver Paquette
67
Voted
MFCS
2005
Springer
15 years 3 months ago
Explicit Inapproximability Bounds for the Shortest Superstring Problem
Abstract. Given a set of strings S = {s1, . . . , sn}, the Shortest Superstring problem asks for the shortest string s which contains each si as a substring. We consider two measur...
Virginia Vassilevska