Sciweavers

2475 search results - page 353 / 495
» On the accuracy of language trees
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 8 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
IUI
2004
ACM
14 years 1 months ago
WOLD: a mixed-initiative wizard for producing multi-platform user interfaces
WOLD (Wizard fOr Leveraging the Development of multi-platform user interfaces) helps designers to produce running user interfaces to data bases of information systems simultaneous...
Julien Stocq, Jean Vanderdonckt
POPL
2007
ACM
14 years 8 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
ICDAR
2009
IEEE
14 years 2 months ago
Robust Recognition of Documents by Fusing Results of Word Clusters
The word error rate of any optical character recognition system (OCR) is usually substantially below its component or character error rate. This is especially true of Indic langua...
Venkat Rasagna, Anand Kumar 0002, C. V. Jawahar, R...