Sciweavers

2200 search results - page 263 / 440
» Bloch's Constant is Computable
Sort
View
CHI
2009
ACM
16 years 1 months ago
Time sequences
Visualisations of dynamic data change in appearance over time, reflecting changes in the underlying data, be that the development of a social network, or the addition or removal o...
Ross Shannon, Aaron J. Quigley, Paddy Nixon
STACS
2009
Springer
16 years 1 months ago
Error-Correcting Data Structures
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...
Ronald de Wolf
ICDCSW
2009
IEEE
16 years 1 months ago
A Geometric Routing Protocol in Disruption Tolerant Network
We describe a novel Geometric Localized Routing (GLR) protocol in Disruption (Delay) Tolerant Network (DTN). Although DTNs do not guarantee the connectivity of the network all the...
Jingzhe Du, Evangelos Kranakis, Amiya Nayak
IPPS
2009
IEEE
16 years 1 months ago
Combining multiple heuristics on discrete resources
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
Marin Bougeret, Pierre-François Dutot, Alfr...
COCO
2009
Springer
119views Algorithms» more  COCO 2009»
16 years 1 months ago
An Approximation Algorithm for Approximation Rank
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
Troy Lee, Adi Shraibman