Sciweavers

229 search results - page 40 / 46
» On the Number of Arrangements of Pseudolines
Sort
View
IJMMS
1998
93views more  IJMMS 1998»
13 years 7 months ago
Construction of problem-solving methods as parametric design
The knowledge-engineering literature contains a number of approaches for constructing or selecting problem solvers. Some of these approaches are based on indexing and selecting a ...
Annette ten Teije, Frank van Harmelen, A. Th. Schr...
PAMI
2002
86views more  PAMI 2002»
13 years 7 months ago
Recognizing Mathematical Expressions Using Tree Transformation
We describe a robust and efficient system for recognizing typeset and handwritten mathematical notation. From a list of symbols with bounding boxes the system analyzes an expressio...
Richard Zanibbi, Dorothea Blostein, James R. Cordy
TSMC
2002
119views more  TSMC 2002»
13 years 7 months ago
Scene analysis by integrating primitive segmentation and associative memory
Scene analysis is a major aspect of perception and continues to challenge machine perception. This paper addresses the scene-analysis problem by integrating a primitive segmentatio...
DeLiang L. Wang, Xiuwen Liu
PUC
2010
139views more  PUC 2010»
13 years 6 months ago
Digital plumbing: the mundane work of deploying UbiComp in the home
Deploying UbiComp in real homes is central to realizing Weiserʼs grand vision of ʻinvisibleʼ computing. It is essential to moving design out of the lab and making it into an unr...
Peter Tolmie, Andy Crabtree, Stefan Rennick Eggles...
ECCC
2011
205views ECommerce» more  ECCC 2011»
13 years 2 months ago
Graphs of Bounded Treewidth can be Canonized in AC1
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
Fabian Wagner