2693 search results - page 100 / 539 » French Order Without Order |
115
Voted
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
: Let (C1, C1), (C2, C2), . . . , (Cm, Cm) be a sequence of ordered pairs of 2CNF clauses chosen uniformly at random (with repetition) from the set of all 4 n 2 clauses on n variab...
137
Voted
ACL
1998
15 years 5 months ago
1998
Several methods are known for parsing languages generated by Tree Adjoining Grammars (TAGs) in O(n 6) worst case running time. In this paper we investigate which restrictions on T...
144
Voted
ICPR
2010
IEEE
15 years 3 months ago
2010
IEEE
We present a method to remove partial occlusion that arises from out-of-focus thin foreground occluders such as wires, branches, or a fence. Such partial occlusion causes the irra...
152
Voted
CAL
2004
15 years 3 months ago
2004
In this paper we present a methodology to design fault-tolerant routing algorithms for regular direct interconnection networks. It supports fully adaptive routing, does not degrade...
154
Voted
VLSISP
1998
15 years 3 months ago
1998
We study the problem of representing images within a multimedia Database Management System (DBMS), in order to support fast retrieval operations without compromising storage e cien...