Sciweavers

11231 search results - page 1869 / 2247
» Digging for Data Structures
Sort
View
ICFP
2006
ACM
16 years 4 months ago
Context-parametric polykinded types
Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class...
Pablo Nogueira
ICFP
2005
ACM
16 years 4 months ago
Associated type synonyms
ML modules and Haskell type classes have proven to be highly effective tools for program structuring. Modules emphasize explicit configuration of program components and the use of...
Manuel M. T. Chakravarty, Gabriele Keller, Simon L...
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
16 years 4 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...
PERCOM
2008
ACM
16 years 4 months ago
Topology Formation in IEEE 802.15.4: Cluster-Tree Characterization
The IEEE 802.15.4 standard defines a set of procedures to set-up a Low-Rate Wireless Personal Area Network where nodes self-organize into a logical communication structure through ...
Francesca Cuomo, Sara Della Luna, Petia Todorova, ...
EWSN
2004
Springer
16 years 4 months ago
Improving the Energy Efficiency of Directed Diffusion Using Passive Clustering
Directed diffusion is a prominent example of data-centric routing based on application layer data and purely local interactions. In its functioning it relies heavily on network-wid...
Andreas Köpke, Christian Frank, Holger Karl, ...
« Prev « First page 1869 / 2247 Last » Next »