Sciweavers

1135 search results - page 101 / 227
» Interactive Problem Solving via Algorithm Visualization
Sort
View
121
Voted
JGO
2010
100views more  JGO 2010»
14 years 9 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti
108
Voted
CG
2007
Springer
15 years 2 months ago
Graphtracker: A topology projection invariant optical tracker
In this paper, we describe a new optical tracking algorithm for pose estimation of interaction devices in virtual and augmented reality. Given a 3D model of the interaction device...
Ferdi A. Smit, Arjen van Rhijn, Robert van Liere
107
Voted
ICDM
2006
IEEE
118views Data Mining» more  ICDM 2006»
15 years 8 months ago
GCA: A Coclustering Algorithm for Thalamo-Cortico-Thalamic Connectivity Analysis
The reciprocal connectivity between the cerebral cortex and the thalamus in a human brain is involved in consciousness and related to various brain disorders, thus, in-vivo analys...
Cui Lin, Shiyong Lu, Xuwei Liang, Jing Hua
107
Voted
FOCS
2002
IEEE
15 years 7 months ago
A Constant-Factor Approximation Algorithm for the Multicommodity
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
Amit Kumar, Anupam Gupta, Tim Roughgarden
114
Voted
GIS
2008
ACM
15 years 3 months ago
Heuristic algorithms for route-search queries over geographical data
In a geographical route search, given search terms, the goal is to find an effective route that (1) starts at a given location, (2) ends at a given location, and (3) travels via...
Yaron Kanza, Eliyahu Safra, Yehoshua Sagiv, Yerach...