Sciweavers

599 search results - page 99 / 120
» The repeater tree construction problem
Sort
View
IANDC
2008
122views more  IANDC 2008»
14 years 9 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza
JVCA
2006
87views more  JVCA 2006»
14 years 9 months ago
Tour into the picture with water surface reflection and object movements
Given a still picture, tour into the picture (TIP) generates a walk-through animation of a 3D scene constructed from the picture. In this paper, we generalize TIP to deal with wat...
Jinho Park, Nambin Heo, Sunghee Choi, Sung Yong Sh...
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
14 years 9 months ago
On Binary Searching with Nonuniform Costs
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...
IPPS
2005
IEEE
15 years 3 months ago
Bootstrapping Free-Space Optical Networks
Title of thesis: BOOTSTRAPPING FREE-SPACE OPTICAL NETWORKS Fang Liu, Master of Science, 2004 Thesis directed by: Professor Uzi Vishkin Department of Electrical and Computer Engine...
Fang Liu, Uzi Vishkin, Stuart Milner
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
15 years 3 months ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara