Sciweavers

2430 search results - page 294 / 486
» Computing Tutte Polynomials
Sort
View
120
Voted
ICALP
2004
Springer
15 years 9 months ago
Representing Nested Inductive Types Using W-Types
We show that strictly positive inductive types, constructed from polynomial functors, constant exponentiation and arbitrarily nested inductive types exist in any Martin-L¨of categ...
Michael Abbott, Thorsten Altenkirch, Neil Ghani
ICALP
2004
Springer
15 years 9 months ago
Easily Refutable Subformulas of Large Random 3CNF Formulas
Abstract. A simple nonconstructive argument shows that most 3CNF formulas with cn clauses (where c is a large enough constant) are not satisfiable. It is an open question whether ...
Uriel Feige, Eran Ofek
103
Voted
ISAAC
2004
Springer
79views Algorithms» more  ISAAC 2004»
15 years 9 months ago
Paired Pointset Traversal
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...
Peter Hui, Marcus Schaefer
136
Voted
MDM
2004
Springer
138views Communications» more  MDM 2004»
15 years 9 months ago
Optimizing Data Placement over Wireless Broadcast Channel for Multi-Dimensional Range Query Processing
Data broadcasting is well known for its excellent scalability. Multi-dimensional range queries, such as spatial range queries of geographical information for location dependent se...
Jianting Zhang, Le Gruenwald
162
Voted
ECCV
2010
Springer
15 years 9 months ago
Affine Puzzle: Realigning Deformed Object Fragments without Correspondences
This paper is addressing the problem of realigning broken objects without correspondences. We consider linear transformations between the object fragments and present the method ...
Csaba Domokos and Zoltan Kato