27692 search results - page 296 / 5539 » Where is ... |
105
click to vote
ALT
2006
Springer
15 years 9 months ago
2006
Springer
Higman showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. We consider the following inductive inferenc...
87
Voted
ICCAD
2003
IEEE
15 years 9 months ago
2003
IEEE
We present an analytic formula for repeater insertion in global interconnects that simultaneously minimizes silicon device area and power dissipation for a given performance qrj,/...
98
Voted
IUI
2009
ACM
15 years 9 months ago
2009
ACM
This document introduces a web based demo of an interactive framework for transcription of handwritten text, where the user feedback is provided by means of pen strokes on a touch...
569
Voted
Lab
Here is a list of computer vision researchers in a tree structure, where the links indicate advisor-advisee (or post-doc) relationship. This is for sure not a comprehensive list of...
73
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
We study systems of equations of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a poly