Sciweavers

5372 search results - page 158 / 1075
» complexity 2007
Sort
View
ANOR
2007
58views more  ANOR 2007»
13 years 8 months ago
A fast swap-based local search procedure for location problems
We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same outpu...
Mauricio G. C. Resende, Renato Fonseca F. Werneck
APVIS
2007
13 years 9 months ago
Level-of-detail visualization of clustered graph layouts
The level-of-detail techniques presented in this paper enable a comprehensible interactive visualization of large and complex clustered graph layouts either in 2D or 3D. Implicit ...
Michael Balzer, Oliver Deussen
NIPS
2004
13 years 9 months ago
VDCBPI: an Approximate Scalable Algorithm for Large POMDPs
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
Pascal Poupart, Craig Boutilier
INTERACT
2007
13 years 9 months ago
Interacting with the Computer Using Gaze Gestures
This paper investigates novel ways to direct computers by eye gaze. Instead of using fixations and dwell times, this work focuses on eye motion, in particular gaze gestures. Gaze g...
Heiko Drewes, Albrecht Schmidt
BMCBI
2006
90views more  BMCBI 2006»
13 years 8 months ago
Dissecting trait heterogeneity: a comparison of three clustering methods applied to genotypic data
Background: Trait heterogeneity, which exists when a trait has been defined with insufficient specificity such that it is actually two or more distinct traits, has been implicated...
Tricia A. Thornton-Wells, Jason H. Moore, Jonathan...