1220 search results - page 42 / 244 » Restricting grammatical complexity |
ISPDC
2007
IEEE
14 years 1 months ago
2007
IEEE
The problem of optimal matrix partitioning for parallel linear algebra on p heterogeneous processors is typically reduced to the geometrical problem of partitioning a unit square ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
ACL
2004
13 years 9 months ago
2004
This paper presents a multi-layered Question Answering (Q.A.) architecture suitable for enhancing current Q.A. capabilities with the possibility of processing complex questions. T...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of ...
COMPGEOM
2010
ACM
14 years 21 days ago
2010
ACM
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...