Sciweavers

793 search results - page 82 / 159
» Efficient computation of the characteristic polynomial
Sort
View
GRAPHICSINTERFACE
2008
13 years 10 months ago
Analyzing the kinematics of bivariate pointing
Despite the importance of pointing-device movement to efficiency in interfaces, little is known on how target shape impacts speed, acceleration, and other kinematic properties of ...
Jaime Ruiz, David Tausky, Andrea Bunt, Edward Lank...
JCP
2008
171views more  JCP 2008»
13 years 8 months ago
Mining Frequent Subgraph by Incidence Matrix Normalization
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
Jia Wu, Ling Chen
AAAI
2006
13 years 10 months ago
Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes)
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
Héctor Palacios, Hector Geffner
JMLR
2006
117views more  JMLR 2006»
13 years 8 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
PAMI
2006
181views more  PAMI 2006»
13 years 8 months ago
Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications....
Kang Li, Xiaodong Wu, Danny Z. Chen, Milan Sonka