Sciweavers

424 search results - page 16 / 85
» Realizability models and implicit complexity
Sort
View
128
Voted
SIGSOFT
2010
ACM
15 years 23 days ago
Building scalable software systems in the multicore era
Software systems must face two challenges today: growing complexity and increasing parallelism in the underlying computational models. The problem of increased complexity is often...
Hridesh Rajan
WEBI
2001
Springer
15 years 7 months ago
A Data Model for XML Databases
In the proposed data model for XML databases, an XML element is directly represented as a ground (variable-free) XML expression—a generalization of an XML element by incorporatio...
Vilas Wuwongse, Kiyoshi Akama, Chutiporn Anutariya...
MOBIHOC
2006
ACM
16 years 2 months ago
Topology control meets SINR: : the scheduling complexity of arbitrary topologies
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
Thomas Moscibroda, Roger Wattenhofer, Aaron Zollin...
DCC
2006
IEEE
16 years 2 months ago
Compression and Machine Learning: A New Perspective on Feature Space Vectors
The use of compression algorithms in machine learning tasks such as clustering and classification has appeared in a variety of fields, sometimes with the promise of reducing probl...
D. Sculley, Carla E. Brodley
3DIM
1997
IEEE
15 years 7 months ago
Multi-Resolution Geometric Fusion
Geometric fusion of multiple sets of overlapping surface measurements is an important problem for complete 3D object or environment modelling. Fusion based on a discrete implicit ...
Adrian Hilton, John Illingworth