Sciweavers

13603 search results - page 34 / 2721
» On the Complexity of Computing Treelength
Sort
View
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 4 months ago
Geodesics in CAT(0) Cubical Complexes
We describe an algorithm to compute the geodesics in an arbitrary CAT(0) cubical complex. A key tool is a correspondence between cubical complexes of global non-positive curvature ...
Federico Ardila, Megan Owen, Seth Sullivant
CORR
2002
Springer
102views Education» more  CORR 2002»
13 years 8 months ago
Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classificatio
The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a chal...
Peter D. Turney
SAC
2008
ACM
13 years 8 months ago
Serpentine: adaptive middleware for complex heterogeneous distributed systems
Adaptation of system parameters is acknowledged as a requirement to scalable and dependable distributed systems. Unfortunately, adaptation cannot be effective when provided solely...
Miguel Matos, Alfrânio Correia Jr., Jos&eacu...
HCI
2009
13 years 6 months ago
MR-Mirror: A Complex of Real and Virtual Mirrors
MR-mirror is a novel Mixed-Reality (MR) display system created by using real and virtual mirrors. It merges real visual information reflected on a real mirror and a virtual one dis...
Hideaki Sato, Itaru Kitahara, Yuichi Ohta
COMCOM
2011
13 years 4 months ago
Palmtree: An IP alias resolution algorithm with linear probing complexity
Internet topology mapping studies utilize large scale topology maps to analyze various characteristics of the Internet. IP alias resolution, the task of mapping IP addresses to th...
M. Engin Tozal, Kamil Saraç