Sciweavers

490 search results - page 69 / 98
» Modeling lobed leaves
Sort
View
ATAL
2010
Springer
13 years 10 months ago
Ants meeting algorithms
Ant robots have very low computational power and limited memory. They communicate by leaving pheromones in the environment. In order to create a cooperative intelligent behavior, ...
Asaf Shiloni, Alon Levy, Ariel Felner, Meir Kalech
CLEF
2010
Springer
13 years 10 months ago
HITS and Misses: Combining BM25 with HITS for Expert Search
Abstract. This paper describes the participation of Dublin City University in the CriES (Cross-Lingual Expert Search) pilot challenge. To realize expert search, we combine traditio...
Johannes Leveling, Gareth J. F. Jones
CGF
2008
128views more  CGF 2008»
13 years 8 months ago
Hierarchical Convex Approximation of 3D Shapes for Fast Region Selection
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...
Marco Attene, Michela Mortara, Michela Spagnuolo, ...
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 8 months ago
How to meet asynchronously (almost) everywhere
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
DAM
2008
75views more  DAM 2008»
13 years 8 months ago
Patterns of simple gene assembly in ciliates
The intramolecular model for gene assembly in ciliates considers three operations, ld, hi, and dlad that can assemble any gene pattern through folding and recombination: the molec...
Tero Harju, Ion Petre, Vladimir Rogojin, Grzegorz ...