Sciweavers

3211 search results - page 578 / 643
» On the Grundy Number of a Graph
Sort
View
ALENEX
2009
191views Algorithms» more  ALENEX 2009»
13 years 10 months ago
Theory and Practise of Monotone Minimal Perfect Hashing
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Seba...
ATAL
2010
Springer
13 years 10 months ago
Image based exploration for indoor environments using local features
d Abstract) Aravindhan K Krishnan Madhava Krishna Supreeth Achar This paper presents an approach to explore an unknown indoor environment using vision as the sensing modality, t...
Aravindhan K. Krishnan, K. Madhava Krishna, Supree...
COMAD
2009
13 years 10 months ago
Epsilon Equitable Partition: A positional analysis method for large social networks
Positional analysis is considered an important tool in the analysis of social networks. It involves partitioning of the set of actors into subsets such that actors in a subset are...
Kiran Kate, Balaraman Ravindran
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
13 years 10 months ago
Evolution of discrete gene regulatory models
Gene regulatory networks (GRNs) are complex control systems that govern the interaction of genes, which ultimately control cellular processes at the protein level. GRNs can be ted...
Afshin Esmaeili, Christian Jacob
GLOBECOM
2008
IEEE
13 years 10 months ago
Blooming Trees for Minimal Perfect Hashing
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
Gianni Antichi, Domenico Ficara, Stefano Giordano,...