Sciweavers

750 search results - page 102 / 150
» Reconstruction for Models on Random Graphs
Sort
View
COMPGEOM
2004
ACM
15 years 5 months ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
15 years 5 months ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...
WAW
2004
Springer
150views Algorithms» more  WAW 2004»
15 years 5 months ago
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
ICPR
2008
IEEE
15 years 6 months ago
Facial feature estimation from the local structural diversity of skulls
In forensics, the craniofacial reconstruction is employed as an initialization of the identification from skulls. It is a challenging work to develop such a system due to the ambi...
Yuru Pei, Hongbin Zha, Zhongbiao Yuan
ICRA
2006
IEEE
131views Robotics» more  ICRA 2006»
15 years 5 months ago
A Practical Algorithm for Network Topology Inference
— When a network of robots or static sensors is emplaced in an environment, the spatial relationships between the sensing units must be inferred or computed for most key applicat...
Dimitri Marinakis, Gregory Dudek